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

Belinda Z. Li, Sewon Min, Srinivasan Iyer, Yashar Mehdad, Wen-tau Yih

Information Extraction Short Paper

Gather-4C: Nov 18, Gather-4C: Nov 18 (02:00-04:00 UTC) [Join Gather Meeting]

You can open the pre-recorded video in a separate window.

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.
NOTE: Video may display a random order of authors. Correct author list is at the top of this page.

Connected Papers in EMNLP2020

Similar Papers

Mention Extraction and Linking for SQL Query Generation
Jianqiang Ma, Zeyu Yan, Shuai Pang, Yang Zhang, Jianping Shen,
A Simple and Effective Model for Answering Multi-span Questions
Elad Segal, Avia Efrat, Mor Shoham, Amir Globerson, Jonathan Berant,
Entity Linking in 100 Languages
Jan A. Botha, Zifei Shan, Daniel Gillick,
Let's Stop Incorrect Comparisons in End-to-end Relation Extraction!
Bruno Taillé, Vincent Guigue, Geoffrey Scoutheeten, Patrick Gallinari,