Sciweavers

Share
PAMI
2010

An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation

8 years 11 months ago
An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation
— Word sense disambiguation (WSD), the task of identifying the intended meanings (senses) of words in context, has been a long-standing research objective for natural language processing. In this paper we are concerned with graph-based algorithms for large-scale WSD. Under this framework, finding the right sense for a given word amounts to identifying the most “important” node among the set of graph nodes representing its senses. We introduce a graph-based WSD algorithm which has few parameters and does not require sense annotated data for training. Using this algorithm, we investigate several measures of graph connectivity with the aim of identifying those best suited for WSD. We also examine how the chosen lexicon and its connectivity influences WSD performance. We report results on standard data sets, and show that our graph-based approach performs comparably to the state of the art.
Roberto Navigli, Mirella Lapata
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where PAMI
Authors Roberto Navigli, Mirella Lapata
Comments (0)
books