Development of a Manipuri stemmer: A hybrid approach

Stemming is the process of removing the affixes from inflected words, without doing complete morphological analysis. A stemming Algorithm reduces all the Inflected words with the same stem to a common form. It is useful in many areas of computational linguistics and information-retrieval work. This technique is used by the various search engines to find the best solution for a problem. The algorithm is a basic building block for the stemmer. Stemmer is basically used in information retrieval system to improve the performance. The paper present a stemmer for Manipuri, which uses a brute force algorithm. We also use a suffix stripping technique in our stemmer. This stemmer can be use as an important tool in information retrieval system for Manipuri language.