Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment | Zendy

Michael Matuschek | Zendy; Iryna Gurevych | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Dijkstra-WSA: A Graph-Based Approach to Word Sense Alignment

Author(s) -

Michael Matuschek,

Iryna Gurevych

Publication year - 2013

Publication title -

transactions of the association for computational linguistics

Language(s) - English

Resource type - Journals

ISSN - 2307-387X

DOI - 10.1162/tacl_a_00217

Subject(s) - wordnet , dijkstra's algorithm , computer science , artificial intelligence , graph , natural language processing , word sense disambiguation , graph traversal , theoretical computer science , shortest path problem

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research