Improving Entity Disambiguation by Reasoning over a Knowledge Base
TL
TL;DR
This work introduces an ED model which links entities by reasoning over a symbolic knowledge base in a fully differentiable fashion, and surpasses state-of-the-art baselines on six well-established ED datasets by 1.3 F1 on average.
Abstract
Recent work in entity disambiguation (ED) has typically neglected structured knowledge base (KB) facts, and instead relied on a limited subset of KB information, such as entity descriptions or types. This limits the range of contexts in which entities can be disambiguated. To allow the use of all KB facts, as well as descriptions and types, we introduce an ED model which links entities by reasoning over a symbolic knowledge base in a fully differentiable fashion. Our model surpasses state-of-the-art baselines on six well-established ED datasets by 1.3 F1 on average. By allowing access to all KB information, our model is less reliant on popularity-based entity priors, and improves performance on the challenging ShadowLink dataset (which emphasises infrequent and ambiguous entities) by 12.7 F1.
References45 items
1
A Knowledge Graph Entity Disambiguation Method Based on Entity-Relationship Embedding and Graph Structure Embedding
2
Robustness Evaluation of Entity Disambiguation Using Prior Probes: the Case of Entity Overshadowing
3
Entity Structure Within and Throughout: Modeling Mention Dependencies for Document-Level Relation Extraction
4
Bootleg: Chasing the Tail with Self-Supervised Named Entity Disambiguation
5