Abstract
Entity Linking (EL) and Word Sense Disambiguation (WSD) both address the lexical ambiguity of language. But while the two tasks are pretty similar, they differ in a fundamental respect: in EL the textual mention can be linked to a named entity which may or may not contain the exact mention, while in WSD there is a perfect match between the word form (better, its lemma) and a suitable word sense. In this paper we present Babelfy, a unified graph-based approach to EL and WSD based on a loose identification of candidate meanings coupled with a densest subgraph heuristic which selects high-coherence semantic interpretations. Our experiments show state-of-the-art performances on both tasks on 6 different datasets, including a multilingual setting. Babelfy is online at http://babelfy.org- Anthology ID:
- Q14-1019
- Volume:
- Transactions of the Association for Computational Linguistics, Volume 2
- Month:
- Year:
- 2014
- Address:
- Cambridge, MA
- Editors:
- Dekang Lin, Michael Collins, Lillian Lee
- Venue:
- TACL
- SIG:
- Publisher:
- MIT Press
- Note:
- Pages:
- 231–244
- Language:
- URL:
- https://aclanthology.org/Q14-1019
- DOI:
- 10.1162/tacl_a_00179
- Cite (ACL):
- Andrea Moro, Alessandro Raganato, and Roberto Navigli. 2014. Entity Linking meets Word Sense Disambiguation: a Unified Approach. Transactions of the Association for Computational Linguistics, 2:231–244.
- Cite (Informal):
- Entity Linking meets Word Sense Disambiguation: a Unified Approach (Moro et al., TACL 2014)
- PDF:
- https://preview.aclanthology.org/emnlp-22-attachments/Q14-1019.pdf
- Data
- AIDA CoNLL-YAGO, DBpedia, Word Sense Disambiguation: a Unified Evaluation Framework and Empirical Comparison