Open Access   Article Go Back

Enhanced Suffix Stripping Algorithm to Improve Information Retrieval

Sundar Singh1 , R K Pateriya2

Section:Research Paper, Product Type: Journal Paper
Volume-3 , Issue-8 , Page no. 115-119, Aug-2015

Online published on Aug 31, 2015

Copyright © Sundar Singh , R K Pateriya . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

View this paper at   Google Scholar | DPI Digital Library

XML View
PDF Download

How to Cite this Paper

  • IEEE Citation
  • MLA Citation
  • APA Citation
  • BibTex Citation
  • RIS Citation

IEEE Style Citation: Sundar Singh , R K Pateriya, “Enhanced Suffix Stripping Algorithm to Improve Information Retrieval,” International Journal of Computer Sciences and Engineering, Vol.3, Issue.8, pp.115-119, 2015.

MLA Style Citation: Sundar Singh , R K Pateriya "Enhanced Suffix Stripping Algorithm to Improve Information Retrieval." International Journal of Computer Sciences and Engineering 3.8 (2015): 115-119.

APA Style Citation: Sundar Singh , R K Pateriya, (2015). Enhanced Suffix Stripping Algorithm to Improve Information Retrieval. International Journal of Computer Sciences and Engineering, 3(8), 115-119.

BibTex Style Citation:
@article{Singh_2015,
author = {Sundar Singh , R K Pateriya},
title = {Enhanced Suffix Stripping Algorithm to Improve Information Retrieval},
journal = {International Journal of Computer Sciences and Engineering},
issue_date = {8 2015},
volume = {3},
Issue = {8},
month = {8},
year = {2015},
issn = {2347-2693},
pages = {115-119},
url = {https://www.ijcseonline.org/full_paper_view.php?paper_id=620},
publisher = {IJCSE, Indore, INDIA},
}

RIS Style Citation:
TY - JOUR
UR - https://www.ijcseonline.org/full_paper_view.php?paper_id=620
TI - Enhanced Suffix Stripping Algorithm to Improve Information Retrieval
T2 - International Journal of Computer Sciences and Engineering
AU - Sundar Singh , R K Pateriya
PY - 2015
DA - 2015/08/31
PB - IJCSE, Indore, INDIA
SP - 115-119
IS - 8
VL - 3
SN - 2347-2693
ER -

VIEWS PDF XML
2415 2281 downloads 2329 downloads
  
  
           

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.

Key-Words / Index Term

Stemming, stop word, Text mining, NLP, IR

References

[1] Porter M.F. “An algorithm for suffix stripping” Program. 1980; 14, 130.
[2] Porter M.F. “Snowball: A language for stemming algorithms”. 2001
[3] Eiman Tamah Al-Shammari “Towards An Error-Free Stemming”, in Proceedings of ADIS European Conference Data Mining 2008, pp. 160-163.
[4] “A Survey on various stemming algorithms” International Journal of Computer Engineering In research trends(IJCERT), VOLUME 2, ISSUE 5, May 2015, PP 310-315
[5] 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.
[6] Frakes William B. “Strength and similarity of affix removal stemming algorithms”. ACM SIGIR Forum, Volume 37, No. 1. 2003, 26-30.
[7] 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
[8] 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
[9] J. B. Lovins, “Development of a stemming algorithm,” Mechanical Translation and Computer Linguistic., vol.11, no.1/2, pp. 22-31, 1968.
[10] Harman Donna. “How effective is suffixing?” Journal of the American Society for Information Science. 1991; 42, 7-15 7.
[11] 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.
[12] 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