IEEE Transactions on Pattern Analysis and Machine Intelligence · 2009 · 292 citations · 72 references
ComputingComputer ScienceComputational LinguisticsKnowledge RepresentationNatural Language ProcessingGraph-based LearningKnowledge GraphsNatural Language UnderstandingSemantic NetworksText MiningWord Sense DisambiguationExperimental Study DesignGraph ConnectivityGraph Connectivity MeasuresGraph-based Word Sense DisambiguationSense AnnotationSense DisambiguationUnsupervised Word Sense DisambiguationWord Sense Induction
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.
72
Artificial intelligence: a modern approach
Choice Reviews Online · 1995 · 22.2K citations · Full text
The Structure and Function of Complex Networks
Michael Newman · SIAM Review · 2003 · 18.7K citations · Full text
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Centrality in social networks conceptual clarification
Linton C. Freeman · Social Networks · 1978 · 16.9K citations