Wen-Tau Yih, Srinivasan Iyer, Sewon Min, Yashar Mehdad, Belinda Li
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
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 (Min et al., 2019). 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2010.02413")
get_code_for_paper("2010.02413")
have("2010.02413")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2010.02413.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2010.02413)
Connect an agent — have() is free.