A bottom up approach to Persian stemming

IJCNLP 2008 - 3rd International Joint Conference on Natural Language Processing, Proceedings of the Conference

Volumn 2, Issue , 2008, Pages 583-588

  Sharifloo, Amir Azim ^a   Shamsfard, Mehrnoush ^a  

^a SHAHID BEHESHTI UNIVERSITY   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM UP; BOTTOM UP APPROACH; LANGUAGE PROCESSING; NATURAL LANGUAGES; PERSIAN LANGUAGES; PERSIANS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 85120182408     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. Bento, Cardoso and Dias. 2005. Progress in Artificial Intellegence, 12th Portuguese Conference on Artificial Intelligence, pages 693-701.
2. Chris Paice. 1996. Method for Evaluation of Stemming Algorithms Based on Error Counting. JASIS, pages 632-649.
3. Frakes and Yates. 1992. Information Retrieval: Data Structures and Algorithms. Prentice Hall, NJ.
4. Mayfield and McNamee. 2003. Single N-gram Stemming. In Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information. retrieval, pages 415-416.
5. Melucci and Orio. 2003. A Novel Method for Stemmer Generation Based on Hidden Markov Models. In Proceedings of Conference on Information and Knowledge Management (CIKM03), pages 131-138.
6. Michela Bacchin, Nicola Ferro, and Massimo Melucci. 2002. Experiments to evaluate a statistical stemming algorithm. Working Notes for CLEF 2002, pages 161-168.
7. Michela Bacchin, Nicola Ferro, and Massimo Melucci. 2002. The Effectiveness of a Graph-Based Algorithm for Stemming. Springer-Verlag Berlin Heidelberg. pages 117-128.
8. Porter. An Algorithm for Suffix Stripping. 1980. Program. pages 130-137.
9. Taghva, Beckley and Sadeh. 2005. A stemming algorithm for the Farsi language. IEEE ITCC 2005, pages 158 - 162.