Cart (Loading....) | Create Account
Close category search window
 

A new stemmer for Farsi language

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Estahbanati, S. ; Sci. & Res. Branch, Dept. of Comput. Eng., Islamic Azad Univ., Khoozestan, Iran ; Javidan, R.

In this paper, we report on the design and implementation of a stemmer for the Farsi language, according to combination of Kazem Taghva's method and improved Krovetz's method. The first method removes the suffixes and prefixes according to the word's structure. And the second method is based on saving the information in a Database. This paper reports a kind of combination of these methods. The results of our evaluation on a small Farsi document collection show a significant improvement in precision/recall.

Published in:

Computer Science and Software Engineering (CSSE), 2011 CSI International Symposium on

Date of Conference:

15-16 June 2011

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.