Efficient One-Pass End-to-End Entity Linking for Questions

10/06/2020
by   Belinda Z. Li, et al.
0

We present ELQ, a fast end-to-end entity linking model for questions, which uses a biencoder to jointly perform mention detection and linking in one pass. Evaluated on WebQSP and GraphQuestions with extended annotations that cover multiple entities per question, ELQ outperforms the previous state of the art by a large margin of +12.7 inference time (1.57 examples/s on a single CPU), ELQ can be useful for downstream question answering systems. In a proof-of-concept experiment, we demonstrate that using ELQ significantly improves the downstream QA performance of GraphRetriever (arXiv:1911.03868). Code and data available at https://github.com/facebookresearch/BLINK/tree/master/elq

READ FULL TEXT
research
04/23/2018

Mixing Context Granularities for Improved Entity Linking on Question Answering Data across Entity Categories

The first stage of every knowledge base question answering approach is t...
research
07/08/2022

ReFinED: An Efficient Zero-shot-capable Approach to End-to-End Entity Linking

We introduce ReFinED, an efficient end-to-end entity linking model which...
research
03/11/2020

Investigating Entity Knowledge in BERT with Simple Neural End-To-End Entity Linking

A typical architecture for end-to-end entity linking systems consists of...
research
02/25/2020

End-to-End Entity Linking and Disambiguation leveraging Word and Knowledge Graph Embeddings

Entity linking - connecting entity mentions in a natural language uttera...
research
09/13/2021

Expanding End-to-End Question Answering on Differentiable Knowledge Graphs with Intersection

End-to-end question answering using a differentiable knowledge graph is ...
research
08/31/2020

PNEL: Pointer Network based End-To-End Entity Linking over Knowledge Graphs

Question Answering systems are generally modelled as a pipeline consisti...

Please sign up or login with your details

Forgot password? Click here to reset