Bon: The persian stemmer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2510 LNCS, Issue , 2002, Pages 487-494

  Tashakori, Masoud ^a   Meybodi, Mohammadreza ^a   Oroumchian, Farhad ^b  

^a AMIRKABIR UNIVERSITY OF TECHNOLOGY   (Iran)

^b UNIVERSITY OF TEHRAN   (Iran)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

NATURAL LANGUAGE PROCESSING; PERSIANS;

NATURAL LANGUAGE PROCESSING SYSTEMS;

EID: 78049327928     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36087-5_57     Document Type: Conference Paper

References (8)

1. Porter M. F., "An Algorithm for Suffix Stripping,", Program, Vol. 14, no. 3, pp. 130-137, 1980.
2. Kraaij W., Pohlmann R., "Evaluation of A Dutch Stemming Algorithm,", The New Review of Document and Text Management, Vol. 1, pp. 25-43, 1995.
3. Frakes W. B., Stemming Algorithms, available at: http://matrix.nbu.bg/ books/books/book5/chap08.htm
4. Hull David A., "Stemming Algorithms: A Case Study for Detailed Evaluation,", Journal of The American Society For Information Science, Vol. 47, no. 10, pp. 70-84, 1996.
5. Harman D., "How effective is suffixing?,", Journal of the American Society for Information Science, Vol. 42, no. 1, pp. 7-15, 1991.
6. Anvari H., and Ahmadi Geavi H. Persian Grammer, Fatemi, Tehran, 1995.
7. Paice C. D., "An Evaluation Method For Stemming Algorithms,", Proceedings of ACM-SIGIR94, pp. 42-50, 1994.
8. Saltan G and McGill M. J., Introduction to Modern Information Retrieval, Mc Graw Hill, New York, 1983.