Efficient One-Pass End-to-End Entity Linking for Questions
TL
TL;DR
ELQ is presented, a fast end-to-end entity linking model for questions, which uses a biencoder to jointly perform mention detection and linking in one pass, and significantly improves the downstream QA performance of GraphRetriever.
Abstract
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% and +19.6% F1, respectively. With a very fast 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 this https URL
References34 items
1
Dense Passage Retrieval for Open-Domain Question Answering
2
Empirical Evaluation of Pretraining Strategies for Supervised Entity Linking
3
Zero-shot Entity Linking with Dense Entity Retrieval
4
Knowledge Guided Text Retrieval and Reading for Open Domain Question Answering
5