Integrating Multiple Knowledge Sources to Disambiguate Word Sense: An Exemplar-Based Approach
arXiv:cmp-lg/9606032
Abstract
In this paper, we present a new approach for word sense disambiguation (WSD) using an exemplar-based learning algorithm. This approach integrates a diverse set of knowledge sources to disambiguate word sense, including part of speech of neighboring words, morphological form, the unordered set of surrounding words, local collocations, and verb-object syntactic relation. We tested our WSD program, named {\sc Lexas}, on both a common data set used in previous work, as well as on a large sense-tagged corpus that we separately constructed. {\sc Lexas} achieves a higher accuracy on the common data set, and performs better than the most frequent heuristic on the highly ambiguous words in the large corpus tagged with the refined senses of {\sc WordNet}.
In Proceedings of ACL96, 8 pages
Cited by in corpus (12)
- A Winnow-Based Approach to Context-Sensitive Spelling Correction
- Memory-Based Learning: Using Similarity for Smoothing
- Sequential Model Selection for Word Sense Disambiguation
- Learning Probabilistic Models of Word Sense Disambiguation
- Evaluating the Effectiveness of Ensembles of Decision Trees in Disambiguating Senseval Lexical Samples
- One Sense per Collocation and Genre/Topic Variations
- Learning Parse and Translation Decisions From Examples With Rich Context
- A Comparison between Supervised Learning Algorithms for Word Sense Disambiguation
- Word sense disambiguation criteria: a systematic study
- Measures of Distributional Similarity
- A Decision Tree of Bigrams is an Accurate Predictor of Word Sense
- Knowledge Sources for Word Sense Disambiguation