Optimizing disambiguation in Swahili

ABSTRACT

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.

References

1. Banerjee, S. and T. Pedersen, 2002. An adapted Lesk algorithm for word sense disambiguation using WordNet. In: Proceedings of the Third International Conference on Intelligent Text Processing and Computational Linguistics, Mexico City, pp. 136--145.
2. Fellbaum, C. (Ed.) 1998. WordNet: An electronic lexical database. MIT Press.
3. Hirst, G. and D. St. Onge 1998. Lexical chains as representations of context for the detection and correction of malapropisms. In: C. Fellbaum (Ed.), WordNet: An electronic lexical database. MIT Press, pp. 305--332.
4. Hurskainen A. 1992. A Two-Level Computer Formalism for the Analysis of Bantu Morphology. An Application to Swahili. Nordic Journal of African Studies 1(1): 87--122.
5. Hurskainen A. 1996. Disambiguation of morphological analysis in Bantu languages. In: Proceedings of COLING-96, pp. 568--573.
6. Jürvinen, T. and P. Tapanainen, 1997. A Dependency Parser for English. Technical Reports, No. TR-1. Department of General Linguistics, University of Helsinki.
7. Kohonen, T. 1995. Self-Organizing Maps. Berlin: Springer.
8. Koskenniemi, K. 1983. Two-level morphology: A general computational model for word-form recognition and production. Publications No.11. Department of General Linguistics, University of Helsinki.
9. Miller, G. 1990. Wordnet: An On-line Lexical Database. International Journal of Lexicography 3(4): 235--312.
10. Nganga, J. 2003. Semantic Analysis of Kiswahili Words Using the Self Organizing Map. Nordic Journal of African Studies, 12(3): 407--425.
11. Resnik, P. 1998a. Semantic similarity in a taxonomy: An information-based measure and its application to problems of ambiguity in natural language. Journal of Artificial Intelligence Research 11:95--130.
12. Resnik, P. 1998b. WordNet and class-based probabilities. In: Fellbaum (Ed.), WordNet: An electronic lexical database. MIT Press, pp. 239--263.
13. Stevenson, M. and Y. Wilks, 2001. The interaction of knowledge sources in word sense disambiguation. Computational Linguistics 27(3): 321--349.
14. Sussna, M. 1993. Word sense disambiguation for free-text indexing using a massive semantic network. In: Proceedings of the Second International Conference on Information and Knowledge Management, pp. 67--74.
15. Tapanainen, P. 1999. Parsing in two frameworks: finite-state and functional dependency grammar. Ph.D. thesis, Department of General Linguistics, University of Helsinki.
16. Tapanainen, P. 1996. The Constraint Grammar Parser CG-2. Publications No. 27. Department of General Linguistics, University of Helsinki.
17. Tapanainen, P. and T. Järvinen, 1997. A nonprojective dependency parser. ANLP'97, Washington, pp. 64--71.
18. Veronis, J. and N. Ide, 1990. Word sense disambiguation with very large neural networks extracted from machine readable dictionaries. In: Proceedings of the 13th International Conference on Computational Linguistics, Helsinki, pp. 389--394.
19. Wilks, Y. and M. Stevenson, 1998. Word sense disambiguation using optimised combinations of knowledge sources. In: Proceedings of the 17th International Conference on Computational Linguistics and the 36th Annual Meeting of the Association for Computational Linguistics, pp. 1398--1402.

• Computing methodologies

  • Artificial intelligence

    • Natural language processing

• Hardware

  • Power and energy

    • Power estimation and optimization

      • Platform power issues