Affiliations Computer Science & Engineering Department Maulana Azad National Institute of Technology Bhopal, India, 462003
Stemming is a technique used to reduce words to their root form called stem, by removing derivational and inflectional affixes.
Most of the existing stemming algorithms uses affix stripping technique. This technique has wide application in NLP, Text mining and
information retrieval. Stemming improves the performance of information retrieval systems by decreasing the index size. There are many
stemming algorithms implemented for English language. Many of these algorithms are working successfully in information retrieval system.
However there are many drawbacks in stemming algorithms, since these algorithms canâ€™t fully describe English morphology. In this paper
Sundar Singh,R K Pateriya."A Survey on various Stemming Algorithms". International Journal of Computer Engineering In Research Trends (IJCERT) ,ISSN:2349-7084 ,Vol.2, Issue 05,pp.310-315, May - 2015, URL :https://ijcert.org/ems/ijcert_papers/V2I57.pdf,
Keywords : Stemming, stop word, recall, precision, Text mining, NLP, IR.
 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.
 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, pp960-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.
 Kjetil, Randi, â€œNews Item Extraction for Text Mining in Web Newspapersâ€ WIRIâ€™05, IEEE, 2009
 Kraaij Wessel and Pohlmann Renee. â€œViewing stemming as recall enhancementâ€. Proceedings of the 19thannual international ACM SIGIR conference on Research and development in information retrieval. 1996, 40-48.
 Krovetz Robert. â€œViewing morphology as an inference processâ€. Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval. 1993, 191-202.
 Mayfield James and McNamee Paul. â€œSingle N-gram stemmingâ€. Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval. 2003, 415- 416.
 Melucci Massimo and Orio Nicola. â€œA novel method for stemmer generation based on hidden Markov modelsâ€. Proceedings of the twelfth international conference on Information and knowledge management. 2003, 131-138.
 Mladenic Dunja. â€œAutomatic word lemmatizationâ€. Proceedings B of the 5th International Multi-Conference Information Society IS. 2002, 153-159.  Paice Chris D. â€œAnother stemmerâ€. ACM SIGIR Forum, Volume 24, No. 3. 1990, 56-61.
 Paice Chris D. â€œAn evaluation method for stemming algorithmsâ€. Proceedings of the 17th annual international ACM SIGIR conferenceon Research and development in information retrieval. 1994, pp. 42-50.
 Plisson Joel, Lavrac Nada and Mladenic Dunja. â€œA rule based approach to word lemmatizationâ€. Proceedings C of the 7th International Multi-Conference Information Society IS. 2004
 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.
Authors are not required to pay any article-processing charges (APC) for their article to be published open access in Journal IJCERT. No charge is involved in any stage of the publication process, from administrating peer review to copy editing and hosting the final article on dedicated servers. This is free for all authors.
News & Events
Latest issue :Volume 10 Issue 1 Articles In press
☞ INVITING SUBMISSIONS FOR THE NEXT ISSUE :
☞ LAST DATE OF SUBMISSION : 31st March 2023
☞ SUBMISSION TO FIRST DECISION : In 7 Days
☞ FINAL DECISION : IN 3 WEEKS FROM THE DAY OF SUBMISSION
All the authors, conference coordinators, conveners, and guest editors kindly check their articles' originality before submitting them to IJCERT. If any material is found to be duplicate submission or sent to other journals when the content is in the process with IJCERT, fabricated data, cut and paste (plagiarized), at any stage of processing of material, IJCERT is bound to take the following actions.
1. Rejection of the article.
2. The author will be blocked for future communication with IJCERT if duplicate articles are submitted.
3. A letter regarding this will be posted to the Principal/Director of the Institution where the study was conducted.
4. A List of blacklisted authors will be shared among the Chief Editors of other prestigious Journals
We have been screening articles for plagiarism with a world-renowned tool: Turnitin However, it is only rejected if found plagiarized. This more stern action is being taken because of the illegal behavior of a handful of authors who have been involved in ethical misconduct. The Screening and making a decision on such articles costs colossal time and resources for the journal. It directly delays the process of genuine materials.