Abstract
In this paper, we present Dijkstra-WSA, a novel graph-based algorithm for word sense alignment. We evaluate it on four different pairs of lexical-semantic resources with different characteristics (WordNet-OmegaWiki, WordNet-Wiktionary, GermaNet-Wiktionary and WordNet-Wikipedia) and show that it achieves competitive performance on 3 out of 4 datasets. Dijkstra-WSA outperforms the state of the art on every dataset if it is combined with a back-off based on gloss similarity. We also demonstrate that Dijkstra-WSA is not only flexibly applicable to different resources but also highly parameterizable to optimize for precision or recall.- Anthology ID:
- Q13-1013
- Volume:
- Transactions of the Association for Computational Linguistics, Volume 1
- Month:
- Year:
- 2013
- Address:
- Cambridge, MA
- Venue:
- TACL
- SIG:
- Publisher:
- MIT Press
- Note:
- Pages:
- 151–164
- Language:
- URL:
- https://aclanthology.org/Q13-1013
- DOI:
- 10.1162/tacl_a_00217
- Cite (ACL):
- Michael Matuschek and Iryna Gurevych. 2013. Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment. Transactions of the Association for Computational Linguistics, 1:151–164.
- Cite (Informal):
- Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment (Matuschek & Gurevych, TACL 2013)
- PDF:
- https://preview.aclanthology.org/nodalida-main-page/Q13-1013.pdf