skip to main content
10.1145/1988688.1988761acmotherconferencesArticle/Chapter ViewAbstractPublication PageswimsConference Proceedingsconference-collections
short-paper

Implementation of a new method for stemming in Persian language

Published:25 May 2011Publication History

ABSTRACT

In this paper, a new stemmer algorithm for the Persian language is implemented. It is based on Kazem Taghva algorithm. The evaluation results of the proposed method on the small Farsi document collections are acceptable. But some problems in the morphological based stemmers in Farsi language are found. So some methods are proposed to solve these problems.

References

  1. Porter, M. 2001. A language for stemming algorithms. DOI= https://snowball.tartarus.org/texts/introduction.html.Google ScholarGoogle Scholar
  2. Tamah Al-Shammari, E. 2008. Towards an Error free Stemming. In Proceeding of IADIS European Conference Data Mining.Google ScholarGoogle Scholar
  3. Riaz, Kashif. 2007. Challenges in Urdu Stemming (A Progress Report). In Proceeding of BCS IRSG Symposium: Future Directions in Information Access (FDIA 2007.) Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Taghva, Kazem, Beckley, R. and Sadeh, M. 2005. A Stemming Algorithm for the Farsi Language. In Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 Pages: 158--162. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Taghva, Kazem, Young, Ron, Coombs, Jeffrey, Beckley, Russell, Sadeh, M., and Pereda, Ray. 2003. Farsi Searching and Display Technologies. In Proceeding of the Symposium. on Document Image Understanding Technology, pages 4146, Greenbelt, MD.Google ScholarGoogle Scholar
  6. Hull, David A. 1995. Stemming Algorithms Case Study for Detailed Evaluation. Technical Report. Rank Xerox Research Centre, Meylen, France.Google ScholarGoogle Scholar
  7. Porter., M. F. 1980. An Algorithm for SUX Stripping. Programs, 14(3):130137.Google ScholarGoogle ScholarCross RefCross Ref
  8. Savoy, J. 1993. Stemming of French Words Based on Grammatical Category. Journal of the American Society for Information Science, vol. 44, no. 1, pp. 1--9.Google ScholarGoogle ScholarCross RefCross Ref
  9. Xu, J. and Croft, B. 1998. Corpus-Based Stemming Using Cooccurrence of Word Variants. ACM-Transactions on Information Systems, vol. 16, no. 1, pp. 61--81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Tomlinson, S. 2004. Lexical and Algorithmic Stemming Compared for 9 European Languages with Hummingbird SearchServerTM at CLEF 2003. In Comparative Evaluation of Multilingual Information Access Systems, ser. Lecture Notes in Computer Science. vol. 3237. Berlin: Springer-Verlag. pp. 286--300.Google ScholarGoogle Scholar
  11. Peters, C., Jijkoun, V., Mandl, T., Muller, H., Oard, D., Peñas, A., and Santos, D. Eds. 2008. Advances in Multilingual and Multimodal Information Retrieval. Lecture Notes in Computer Science. Berlin: Springer-Verlag. vol. 5152. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Korenius, T., Laurikkala, J., Jarvelin, K., and Juhola, M. 2004. Stemming and Lemmatization in The Clustering of Finish Text Documents. In Proceedings of the ACM-CIKM. Washington DC: The ACM Press. pp. 625--633. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Dolamic, Ljiljana, and Savoy, Jacques 2009. Persian Language, is Stemming Efficient?. In Proceeding of 20th International Workshop on Database and Expert Systems Application (DEXA '09). Pages: 388--392. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Ghasem Sani, GholamReza, and Hesami, Reza 2006. A Stemming Algorithm for Farsi Language. In Proceeding of 11 International CSI Computer Conference (CSICC'2006).Google ScholarGoogle Scholar
  15. Azim Sharifloo, Amir, and Shamsfard, Mehrnoush. A Bottom up Approach to Persian Stemming. Shahid Beheshti University, Tehran, Iran.Google ScholarGoogle Scholar

Index Terms

  1. Implementation of a new method for stemming in Persian language

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Other conferences
        WIMS '11: Proceedings of the International Conference on Web Intelligence, Mining and Semantics
        May 2011
        563 pages
        ISBN:9781450301480
        DOI:10.1145/1988688

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 25 May 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        Overall Acceptance Rate140of278submissions,50%

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader