##plugins.themes.academic_pro.article.main##
Abstract
Stemming is a process in in which different morphological variants of a word is transformed into its root form. A stemmer involves removing prefixes and suffixes of a word to reduce a word to its root form. This process is used in information retrieval systems and text applications in order to improve the efficiency of text retrieval.
Keywords: over stemming, under stemming, inflections, derivational analysis, rule based stemmer##plugins.themes.academic_pro.article.details##
How to Cite
Hegde, A., & Shetty, M. S. K. (2015). A Study on Stemming Algorithms. International Journal of Emerging Trends in Science and Technology, 2(05). Retrieved from https://igmpublication.org/ijetst.in/index.php/ijetst/article/view/673
References
1. Porter M.F. “An algorithm for suffix strippingâ€.Program. 1980; 14, 130-137.
2. Porter M.F. “Snowball: A language for stemmingalgorithmsâ€. 2001.
3. J. B. Lovins, “Development of a stemmingalgorithm,†Mechanical Translation and ComputerLinguistic., vol.11, no.1/2, pp. 22-31, 1968.
4. Paice Chris D. “Another stemmerâ€. ACM SIGIRForum, Vol. 24, No. 3. 1990, 56-61.
5. Paice Chris D. “An evaluation method for stemmingalgorithmsâ€. Proceedings of the 17th annualinternational ACM SIGIR conference on Researchand development in information retrieval. 1994, 42-50.
6. Dawson, J. L. (1974); Suffix Removal for Word Conflation, Bulletin of the Association for Literary and Linguistic Computing, 2(3): 33–46
7. J. Mayfield and P. McNamee, “Single N-gram stemmingâ€, Proceedings of the 26th annual international ACM SIGIR Conference on Research and Development in InformationRetrieval, 415-416, 2003.
8. M. Massimo and O. Nicola. “A Novel Method for Stemmer Generation based on Hidden Markov Modelsâ€,Proceedings of the twelfth international conference onInformation and knowledge management, 131-138, 2003.
9. Prasenjit Majumder, Mandar Mitra, Swapan K. Parui, Gobinda Kole, Pabitra Mitra and Kalyankumar Datta. “YASS: Yet another suffix stripperâ€. ACM Transactions on Information Systems. Volume 25, Issue 4. 2007, Article No. 18.
10. Hull D. A. and Grefenstette,.“ A detailed analysis of English Stemming Algorithmsâ€, XEROX Technical Report, http://www.xrce.xerox.
11. J. A. Goldsmith, “Unsupervised Learning of the Morphology of a Natural Languageâ€, ComputationalLinguistics, MIT Press, 27(2):153-198, 2001.
12. Vishal Gupta, “Hindi Rule Based Stemmer for Nounsâ€, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 1, January 2014.
13. Suprabhat Das, Pabitra Mitra, “A Rule-based Approach of Stemming for Inflectional and Derivational Words in Bengaliâ€, Proceeding of the IEEE Students' Technology Symposium, PP.14-16, January, 2011.
14. M.Thangarasu. R.Manavalan, “Design and Development of Stemmer for Tamil Language: Cluster Analysisâ€, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 3, Issue 7, July 2013.
15. Dhamodharan Rajalingam ,A Rule Based Iterative Affix Stripping Stemming Algorithm for Tamilâ€, vol 132, PP-583-590, 2012.
2. Porter M.F. “Snowball: A language for stemmingalgorithmsâ€. 2001.
3. J. B. Lovins, “Development of a stemmingalgorithm,†Mechanical Translation and ComputerLinguistic., vol.11, no.1/2, pp. 22-31, 1968.
4. Paice Chris D. “Another stemmerâ€. ACM SIGIRForum, Vol. 24, No. 3. 1990, 56-61.
5. Paice Chris D. “An evaluation method for stemmingalgorithmsâ€. Proceedings of the 17th annualinternational ACM SIGIR conference on Researchand development in information retrieval. 1994, 42-50.
6. Dawson, J. L. (1974); Suffix Removal for Word Conflation, Bulletin of the Association for Literary and Linguistic Computing, 2(3): 33–46
7. J. Mayfield and P. McNamee, “Single N-gram stemmingâ€, Proceedings of the 26th annual international ACM SIGIR Conference on Research and Development in InformationRetrieval, 415-416, 2003.
8. M. Massimo and O. Nicola. “A Novel Method for Stemmer Generation based on Hidden Markov Modelsâ€,Proceedings of the twelfth international conference onInformation and knowledge management, 131-138, 2003.
9. Prasenjit Majumder, Mandar Mitra, Swapan K. Parui, Gobinda Kole, Pabitra Mitra and Kalyankumar Datta. “YASS: Yet another suffix stripperâ€. ACM Transactions on Information Systems. Volume 25, Issue 4. 2007, Article No. 18.
10. Hull D. A. and Grefenstette,.“ A detailed analysis of English Stemming Algorithmsâ€, XEROX Technical Report, http://www.xrce.xerox.
11. J. A. Goldsmith, “Unsupervised Learning of the Morphology of a Natural Languageâ€, ComputationalLinguistics, MIT Press, 27(2):153-198, 2001.
12. Vishal Gupta, “Hindi Rule Based Stemmer for Nounsâ€, International Journal of Advanced Research in Computer Science and Software Engineering, Volume 4, Issue 1, January 2014.
13. Suprabhat Das, Pabitra Mitra, “A Rule-based Approach of Stemming for Inflectional and Derivational Words in Bengaliâ€, Proceeding of the IEEE Students' Technology Symposium, PP.14-16, January, 2011.
14. M.Thangarasu. R.Manavalan, “Design and Development of Stemmer for Tamil Language: Cluster Analysisâ€, International Journal of Advanced Research in Computer Science and Software Engineering, Vol. 3, Issue 7, July 2013.
15. Dhamodharan Rajalingam ,A Rule Based Iterative Affix Stripping Stemming Algorithm for Tamilâ€, vol 132, PP-583-590, 2012.