Enhanced Suffix Stripping Algorithm to Improve Information Retrieval

Authors

  • Singh S Department of Computer Science & Engineering Maulana Azad National Institute of Technology Bhopal, India, 462003
  • RK Pateriya Department of Computer Science & Engineering Maulana Azad National Institute of Technology Bhopal, India, 462003

Keywords:

Stemming, stop word, Text mining, NLP, IR

Abstract

Stemming algorithms are used to convert the words in text into their grammatical base form, and are mainly used to increase the Information Retrieval System’s efficiency. Several algorithms exist with altered techniques. The most widely used is the Porter Stemming algorithm. However, it still has several drawbacks, although many attempts were made to improve its structure. This paper discloses the inaccuracies encountered during the stemming process and proposes the corresponding solutions.

References

Porter M.F. “An algorithm for suffix stripping” Program. 1980; 14, 130.

Porter M.F. “Snowball: A language for stemming algorithms”. 2001

Eiman Tamah Al-Shammari “Towards An Error-Free Stemming”, in Proceedings of ADIS European Conference Data Mining 2008, pp. 160-163.

“A Survey on various stemming algorithms” International Journal of Computer Engineering In research trends(IJCERT), VOLUME 2, ISSUE 5, May 2015, PP 310-315

Frakes W.B. “Term conflation for information retrieval”. Proceedings of the 7th annual international ACM SIGIR conference on Research and development in information retrieval. 1984, 383-389.

Frakes William B. “Strength and similarity of affix removal stemming algorithms”. ACM SIGIR Forum, Volume 37, No. 1. 2003, 26-30.

M. Nithya, “Clustering Technique with Porter stemmer and Hyper graph Algorithms for Multi-featured Query Processing”, International Journal of Modern Engineering Research (IJMER), Vol.2, Issue.3, pp-960-965, May-June 2012

Galvez Carmen and Moya-Aneg•n F˜lix. “An Evaluation of conflation accuracy using finite-state transducers”. Journal of Documentation 62(3). 2006, 328-349

J. B. Lovins, “Development of a stemming algorithm,” Mechanical Translation and Computer Linguistic., vol.11, no.1/2, pp. 22-31, 1968.

Harman Donna. “How effective is suffixing?” Journal of the American Society for Information Science. 1991; 42, 7-15 7.

Funchun Peng, Nawaaz Ahmed, Xin Li and Yumao Lu. “Context sensitive stemming for web search”. Proceedings of the 30th annual international ACMSIGIR conference on Research and development in information retrieval. 2007, 639-646.

R. Sun, C.-H. Ong, and T.-S. Chua. “Mining Dependency Relations for Query Expansion in Passage Retrieval”. In SIGIR, 2006.

Kjetil , Randi, “News Item Extraction for Text Mining in Web Newspapers” WIRI’05,IEEE ,2009

Downloads

Published

2025-11-10

How to Cite

[1]
S. Singh and R. Pateriya, “Enhanced Suffix Stripping Algorithm to Improve Information Retrieval”, Int. J. Comp. Sci. Eng., vol. 3, no. 8, pp. 115–119, Nov. 2025.

Issue

Vol. 3 No. 8 (2015): IJCSE August Edition

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.