The reviewed record of science sign in
Pith

arxiv: 2110.02369 · v2 · pith:ZXET6W5D · submitted 2021-10-05 · cs.CL · cs.LG

EntQA: Entity Linking as Question Answering

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZXET6W5Drecord.jsonopen to challenge →

classification cs.CL cs.LG
keywords entityentqalinkingansweringapproachentitiesmentionsquestion
0
0 comments X
read the original abstract

A conventional approach to entity linking is to first find mentions in a given document and then infer their underlying entities in the knowledge base. A well-known limitation of this approach is that it requires finding mentions without knowing their entities, which is unnatural and difficult. We present a new model that does not suffer from this limitation called EntQA, which stands for Entity linking as Question Answering. EntQA first proposes candidate entities with a fast retrieval module, and then scrutinizes the document to find mentions of each candidate with a powerful reader module. Our approach combines progress in entity linking with that in open-domain question answering and capitalizes on pretrained models for dense entity retrieval and reading comprehension. Unlike in previous works, we do not rely on a mention-candidates dictionary or large-scale weak supervision. EntQA achieves strong results on the GERBIL benchmarking platform.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.