Word sense disambiguation for free-text indexing using a massive semantic network
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Self-organizing maps
An Adapted Lesk Algorithm for Word Sense Disambiguation Using WordNet
CICLing '02 Proceedings of the Third International Conference on Computational Linguistics and Intelligent Text Processing
The interaction of knowledge sources in word sense disambiguation
Computational Linguistics
A non-projective dependency parser
ANLC '97 Proceedings of the fifth conference on Applied natural language processing
Word sense disambiguation using optimised combinations of knowledge sources
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Disambiguation of morphological analysis in Bantu languages
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 2
Hi-index | 0.00 |
It is argued in this paper that an optimal solution to disambiguation is a combination of linguistically motivated rules and resolution based on probability or heuristic rules. By disambiguation is here meant ambiguity resolution on all levels of language analysis, including morphology and semantics. The discussion is based on Swahili, for which a comprehensive analysis system has been developed by using two-level description in morphology and constraint grammar formalism in disambiguation. Particular attention is paid to optimising the use of different solutions for achieving maximal precision with minimal rule writing.