English

EntQA: Entity Linking as Question Answering

Computation and Language 2022-03-09 v2 Machine Learning

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.

Keywords

Cite

@article{arxiv.2110.02369,
  title  = {EntQA: Entity Linking as Question Answering},
  author = {Wenzheng Zhang and Wenyue Hua and Karl Stratos},
  journal= {arXiv preprint arXiv:2110.02369},
  year   = {2022}
}

Comments

ICLR 2022

R2 v1 2026-06-24T06:39:04.711Z