Morpho-Phonological Modelling in Natural Language Processing
Authors: Eleni Galiotou, Angela Ralli
Abstract:
In this paper we propose a computational model for the representation and processing of morpho-phonological phenomena in a natural language, like Modern Greek. We aim at a unified treatment of inflection, compounding, and word-internal phonological changes, in a model that is used for both analysis and generation. After discussing certain difficulties cuase by well-known finitestate approaches, such as Koskenniemi-s two-level model [7] when applied to a computational treatment of compounding, we argue that a morphology-based model provides a more adequate account of word-internal phenomena. Contrary to the finite state approaches that cannot handle hierarchical word constituency in a satisfactory way, we propose a unification-based word grammar, as the nucleus of our strategy, which takes into consideration word representations that are based on affixation and [stem stem] or [stem word] compounds. In our formalism, feature-passing operations are formulated with the use of the unification device, and phonological rules modeling the correspondence between lexical and surface forms apply at morpheme boundaries. In the paper, examples from Modern Greek illustrate our approach. Morpheme structures, stress, and morphologically conditioned phoneme changes are analyzed and generated in a principled way.
Keywords: Morpho-Phonology, Natural Language Processing.
Digital Object Identifier (DOI): doi.org/10.5281/zenodo.1333264
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2129References:
[1] E.L. Antworth, PC-KIMMO: A Two-Level Processor for Morphological Analysis (Occasional Publications in Academic Computing 16), Summer Institute of Linguistics, Dallas TX,1990.
[2] E.L. Antworth, "Morphological parsing with a unification-based word grammar", in Proceedings of the North-Texas Natural Language Workshop, University of Texas, Arlington,1994.
[3] E. Galiotou and A. Ralli, "Parsing Deficiencies of the PC-KIMMO System", in Proceedings of the 2nd Hellenic Conference on Artificial Intelligence (Companion Volume), Aristotle University, Thessaloniki, 2002, pp.53-64.
[4] R. Kaplan and M. Kay, "Phonological rules and finite state transducers", in Proceedings of the ACL/LSA Conference, NewYork, 1981.
[5] L. Karttunen, "KIMMO: A general morphological processor", Texas Linguistic Forum, 22, 1983, pp. 163-186.
[6] L. Karttunen. and K. Oflazer (eds.), Special Issue on Finite State Methods in NLP, Computational Linguistics, 26, 1, 2000.
[7] Koskenniemi, K, "Two-level model for morphological analysis", in Proceedings of IJCAI-83, 1983, pp. 683-68.
[8] K. Koskenniemi, Two-level Morphology: A General computational Model for Word-Form Recognition and Production, Ph.D. Thesis, University of Helsinki, 1983.
[9] M. Nespor and A. Ralli, "Morphology-Phonology interface: phonological domains in Greek compounds", in The Linguistic Review, 13, 1996, pp. 357-382.
[10] A. Ralli, "Compounds in Modern Greek", in Rivista di Linguistica, 4, 1, 1992, pp.143-174.
[11] A. Ralli, "On the morphological status of inflectional features: evidence from Modern Greek" , in G. Horrocks, B. Joseph and I. Philippaki- Warburton (eds.), Themes in Greek Linguistics II, John Benjamins, 1998, pp. 51-74.
[12] A. Ralli, "A feature-based analysis of Greek nominal inflection", Glossolojia, 11-12, 2000, pp.201-227.
[13] A. Ralli, " The role of morphology in gender determination: evidence from Modern Greek" , in Linguistics 40, 3, pp. 519-551.
[14] A. Ralli, ╬£╬┐¤ü¤å╬┐λ╬┐╬│╬»╬▒ (Morphology), Patakis, Athens, forthcoming.
[15] A. Ralli and E. Galiotou, "A prototype for a computational analysis of Modern Greek compounds", Asymmetry Conference, Université de Québec, ├á Montréal, May 2001.
[16] K. Sgarbas, N. Fakotakis and G. Kokkinakis, "A PC-KIMMO based morphological analysis of Modern Greek", in Literary and Linguistic Computing, 10, 3, 1995, pp. 189-201.
[17] S.M. Shieber, An Introduction to Unification-Based Approaches to Grammar
[CSLI Lecture Notes No 4], Stanford, CA, 1986.
[18] R. Sproa t, Morphology and Computation, MIT Press, 1992.
[19] L. Touratzidis and A. Ralli, "Stress in Greek inflected forms: A computational treatment" , in Language and Speech, 35, 1992, pp. 435- 453.
[20] K. Wallace, K. (ed.), Morphology as a Computational Problem, UCLA Occasional Papers #7, Dept. of Linguistics, UCLA, 1998.