Word sense disambiguation for unrestricted text is one of the most difficult tasks in the fields of computational linguistics. The crux of the problem is to discover a model that ...
This paper presents a graph-theoretical approach to lexical disambiguation on word co-occurrences. Producing a dictionary similar to WordNet, this method is the counterpart to word...
Word sense disambiguation algorithms, with few exceptions, have made use of only one lexical knowledge source. We describe a system which t)erforms word sense disambiguation on al...
In word sense disambiguation, choosing the most frequent sense for an ambiguous word is a powerful heuristic. However, its usefulness is restricted by the availability of sense-an...
When a word sense disambiguation (WSD) system is trained on one domain but applied to a different domain, a drop in accuracy is frequently observed. This highlights the importance...