A Bottom Up approach to Persian Stemming

Stemmers have many applications in natural language processing and some fields such as information retrieval. Many algorithms have been proposed for stemming. In this paper, we propose a new algorithm for Persian language. Our algorithm is a bottom up algorithm that is capable to reorganize without changing the implementation. Our experiments show that the proposed algorithm has a suitable result in stemming and flexibility.

[1]  J. Mathias,et al.  Program , 1970, Symposium on VLSI Technology.

[2]  Nicola Orio,et al.  A novel method for stemmer generation based on hidden markov models , 2003, CIKM '03.

[3]  L. R. Rasmussen,et al.  In information retrieval: data structures and algorithms , 1992 .

[4]  Nicola Ferro,et al.  University of Padua at CLEF 2002: Experiments to Evaluate a Statistical Stemming Algorithm , 2002, CLEF.

[5]  Nicola Ferro,et al.  The Effectiveness of a Graph-Based Algorithm for Stemming , 2002, ICADL.

[6]  Chris D. Paice.  Method for Evaluation of Stemming Algorithms Based on Error Counting , 1996, J. Am. Soc. Inf. Sci..

[7]  M. F. Porter,et al.  An algorithm for suffix stripping , 1997 .

[8]  Kazem Taghva,et al.  A stemming algorithm for the Farsi language , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[9]  James Mayfield,et al.  Single n-gram stemming , 2003, SIGIR.