Ksh. Krishna B. Singha; Kh. Raju Singha; Bipul Syam Purkayastha

Morphotactics of Manipuri Adjectives: A FiniteState Approach

Full Text (PDF, 421KB), PP.94-100

Views: 0 Downloads: 0

Author(s)

Ksh. Krishna B. Singha ^1,* Kh. Raju Singha ¹ Bipul Syam Purkayastha ¹

1. Department of Computer Science, Assam University, Silchar, India

* Corresponding author.

DOI: https://doi.org/10.5815/ijitcs.2013.09.10

Received: 27 Sep. 2012 / Revised: 6 Feb. 2013 / Accepted: 23 Apr. 2013 / Published: 8 Aug. 2013

Index Terms

Morphotactics, Natural Language Processing, Artificial Intelligence, Finite-State Automata, Manipuri Adjectives

Abstract

This paper presents a constrained finite-state model to represent the morphotactic rule of Manipuri adjective word forms. There is no adjective word category in Manipuri language. By rule this category is derived from verb roots with the help of some selected affixes applicable only to verb roots. The affixes meant for the purpose and the different rules for adjective word category formation are identified. Rules are composed for describing the simple agglutinative morphology of this category. These rules are combined to describe the more complex morphotactic structures. Finite-state machine is used to describe the concatenation rules and corresponding non-deterministic and deterministic automaton are developed for ease of computerization. A root lexicon of verb category words is used along with an affix dictionary in a database. The system is capable to analyze and recognize a certain word as adjective by observing the morpheme concatenation rule defined with the help of finite-state networks.

Cite This Paper

Ksh. Krishna B. Singha, Kh. Raju Singha, Bipul Syam Purkayastha, "Morphotactics of Manipuri Adjectives: A Finite-State Approach", International Journal of Information Technology and Computer Science(IJITCS), vol.5, no.9, pp.94-100, 2013. DOI:10.5815/ijitcs.2013.09.10

Reference

[1]Mohri, Mehryar. Finite-State Transducers in Language and Speech Processing[J]. Computational Linguistics, 1997, 23(2): 269–312.

[2]Kaplan, Ronald M. and Martin Kay. Regular models of phonological rule systems[J], Computational Linguistics, 1994, 20(3): 331-378.

[3]Karttunen, Lauri, Ronald M. Kaplan, and Annie Zaenen, Two-level morphology with composition[C], In Proceedings of the Fifteenth International Conference on Computational Linguistics, 1992, Aug 23-28, 141-148

[4]Mohri, Mehryar, Fernando C. N. Pereira, and Michael Riley, Weighted automata in text and speech processing, In Proceedings of the 12th biennial European Conference on Artificial Intelligence (ECAI-96), Workshop on Extended finite state models of language. Budapest, Hungary, 1996. John Wiley and Sons, Chichester.

[5]S. Imoba Singh, L. Sarbajit Singh. Manipuri Adjectives- A New Approach[J], Linguistics of the Tibeto-Burman Area, Volume 25.2, Fall 2002.

[6]Singha, Ch. Yashwanta, Manipuri Grammar[B], Rajesh publications, New Delhi, 2000.

[7]Bhatt, D.N.S, Ningomba, M.S., Manipuri Grammar[B], LINCOM Europa, 1997.

[8]A. V. Aho, R. Sethi & J. D. Ullman, Compilers: principles, techniques, tools (Reading, MA: Addison-Wesley, 1986).

International Journal of Information Technology and Computer Science (IJITCS)