We apologize for a recent technical issue with our email system, which temporarily affected account activations. Accounts have now been activated. Authors may proceed with paper submissions. PhDFocusTM
CFP last date
20 November 2024
Call for Paper
December Edition
IJCA solicits high quality original research papers for the upcoming December edition of the journal. The last date of research paper submission is 20 November 2024

Submit your paper
Know more
The week's pick
Responsive image
An Efficient Restoration Method for the Faint Dot Matrix Images

Ao Zhu Peng Cao
Random Articles
Reseach Article

Morphological Analysis for Manipuri Nominal Category Words with Finite State Techniques

by Ksh. Krishna B. Singha, Bipul Syam Purkyastha
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 58 - Number 15
Year of Publication: 2012
Authors: Ksh. Krishna B. Singha, Bipul Syam Purkyastha
10.5120/9355-3688

Ksh. Krishna B. Singha, Bipul Syam Purkyastha . Morphological Analysis for Manipuri Nominal Category Words with Finite State Techniques. International Journal of Computer Applications. 58, 15 ( November 2012), 1-6. DOI=10.5120/9355-3688

@article{ 10.5120/9355-3688,
author = { Ksh. Krishna B. Singha, Bipul Syam Purkyastha },
title = { Morphological Analysis for Manipuri Nominal Category Words with Finite State Techniques },
journal = { International Journal of Computer Applications },
issue_date = { November 2012 },
volume = { 58 },
number = { 15 },
month = { November },
year = { 2012 },
issn = { 0975-8887 },
pages = { 1-6 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume58/number15/9355-3688/ },
doi = { 10.5120/9355-3688 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:02:34.020464+05:30
%A Ksh. Krishna B. Singha
%A Bipul Syam Purkyastha
%T Morphological Analysis for Manipuri Nominal Category Words with Finite State Techniques
%J International Journal of Computer Applications
%@ 0975-8887
%V 58
%N 15
%P 1-6
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The paper presents the design and the implementation of a morphological analyzer for Manipuri nominal category words. A method for the analysis of nominal category Manipuri words with a suffix stripping approach in a right to left direction without using any lexicon has been proposed. Manipuri being an agglutinative language and its rule-based nature while morpheme concatenation allows the morphotactics of the different available word forms to be modeled with finite state machines (FSMs). Also the very feature of the word classes which possess the characteristics that they can only be attached with affixes meant for that class only make it possible to analyze a nominal word without a lexicon. This paper discusses the morphological features of Manipuri nominal category, identifying the affixes for this class, and the steps of the new methodology to develop the FSM for nominal category to represent the morphotactics of the language, converting the FSM from non-deterministic finite automata (NFA) to deterministic finite automata (DFA) and thereby cooperating the analysis.

References
  1. Karttunen, Lauri, Ronald M. Kaplan and Annie Zaenen (1992). Two-Ievel Morphology with Composition. In the Proceedings of the fifteenth International Conference on Computational Linguistics. Coling-. 92. Nantes, 23-28/8/1992. Vol. 1 141-48. ICCL.
  2. Karttunen, Lauri, Applications of Finite-State Transducers in Natural-Language Processing, Xerox Research Centre Europe.
  3. Kenneth R. BEESLEY, Xerox Research Centre Europe, Arabic Morphology Using Only Finite-State Operations
  4. Karttunen, Lauri, Constructing Lexical Transducers, Rank Xerox Research Centre, Grenoble
  5. Kenneth R. Beesley and Lauri Karttunen. 2003, Finite State Morphology. Center for the Study of Language and Information, April.
  6. Kay, Martin, and Ronald M. Kaplan. 1994, Regular Models of Phonological Rule Systems. Computational Linguistics
  7. M. Mohri, 1994a, Compact Representations by Finite State Transducers, In Proceedings of the 32nd Annual Meeting, Las Cruces, New Mexico. Association for Computational Linguistics
  8. ARONOFF, M. & FUDEMAN, K. , 2004, What is Morphology? Blackwell Publishing: Cornwall.
  9. A. V. Aho, R. Sethi & J. D. Ullman, Compilers: principles, techniques, tools (Reading, MA: Addison-Wesley, 1986).
  10. Gül?en Eryi?it and E?ref Adal?,2004, AN AFFIX STRIPPING MORPHOLOGICAL ANALYZER FOR TURKISH, Proceedings of the IASTED International Conference ARTIFICIAL INTELLIGENCE AND APPLICATIONS, February 16-18 2004,Innsbruck, Austria
  11. Evan L. Antworth. 1990. PC-KIMMO: a two-level processor for morphological analysis. Number 16 in Occasional publications in academic computing. Summer Institute of Linguistics, Dallas
  12. Kimmo Koskenniemi. 1983. Two-level morphology: A general computational model for word-form recognition and production. Publication 11, University of Helsinki, Department of General Linguistics, Helsinki
  13. Ch. Yashwanta Singha, 2000, Manipuri Grammar, Rajesh Publications.
  14. D. N. S. Bhatt & M. S. Ningomba, 1997, Manipuri Grammar, LINCOM EUROPA
Index Terms

Computer Science
Information Sciences

Keywords

Agglutinative Morphological Analysis Finite State Transducers Manipuri and Nominal Category Computational Linguistics

Powered by PhDFocusTM