Design of an Inflectional Rule-Based Assamese Stemmer
Swagata Seal1, Nisheeth Joshi2
1Swagata Seal, Department of Computer Science, Banasthali Vidyapith (Rajasthan), India.
2Nisheeth Joshi, Department of Computer Science, Banasthali Vidyapith (Rajasthan), India.
Manuscript received on 07 April 2019 | Revised Manuscript received on 20 April 2019 | Manuscript published on 30 April 2019 | PP: 1651-1655 | Volume-8 Issue-6, April 2019 | Retrieval Number: F4059048619/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Assamese is a very morphologically rich language. A little work has been done on Assamese Language Processing. . As Assamese is one of the most resource poor languages in the field of computational studies thus, we intend to present an inflectional rule-based stemmer for Assamese language. Stemming is the simplest and prior step for natural language processing (NLP), it is a procedure which removes the suffixes from the root word. This performs very little morphological analysis. After stemming the resultant word is known as ‘Stem’ or root word. The proposed system is language dependent and domain independent. A suffix stripping algorithm is used to design the system. The system is evaluated with 20,000 words.
Keyword: Assamese, Resource Poor Language, Stemming, Suffix Stripping.
Scope of the Article: Web-Based Learning: Innovation and Challenges