## An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation

### Cached

### Download Links

Venue: | IEEE TPAMI |

Citations: | 35 - 10 self |

### BibTeX

@MISC{Navigli_anexperimental,

author = {Roberto Navigli and Mirella Lapata},

title = { An Experimental Study of Graph Connectivity for Unsupervised Word Sense Disambiguation},

year = {}

}

### OpenURL

### Abstract

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.