International Journal of Education and Management Engineering(IJEME)

ISSN: 2305-3623 (Print), ISSN: 2305-8463 (Online)

Published By: MECS Press

IJEME Vol.8, No.5, Sep. 2018

Bruteporter: A Hybrid Approach

Full Text (PDF, 293KB), PP.11-17

Views:18   Downloads:1


Balamurugan Mahalingam, Kannan S, Vairaprakash Gurusamy

Index Terms



Stemming fetches the main root word from the inflectional words called stem. Stem gives different meaning when suffix or prefix is added to it. The stem need not give perfect meaning. Lemmatization gives lemma from inflectional words. Lemma should give meaning that in the dictionary form. Natural Language processing, Information retrieval, Text mining are the areas which use the stemming as preprocessing step. Through stemming, the size of the document can be reduced and ambiguity is also removed. It makes the work easy for other process likes information retrieval, semantic analysis, text categorization etc. Though there is a need for linguistic improvements in the existing stemming algorithms, all these algorithms fail in some cases to give an exact Root word and are not able to handle informal verbs. Hence, Bruteporter Hybrid approach is proposed in order to improve the linguistic process of stemming in English Texts. It combines the Wordnet and Modified Porter Algorithm. A Wordnet is a lexical dictionary created by linguistics people. Modified porter algorithm has both suffix removal and suffix substitution functionality. This proposed approach can extract root word from both inflectional words and informal verbs. In this paper, Experiment is conducted on proposed algorithm and the accuracy is calculated.

Cite This Paper

Balamurugan Mahalingam, Kannan S, Vairaprakash Gurusamy,"Bruteporter: A Hybrid Approach", International Journal of Education and Management Engineering(IJEME), Vol.8, No.5, pp.11-17, 2018.DOI: 10.5815/ijeme.2018.05.02


[1]Brychcín, T., & Konopík, M. (2015). HPS: High recision stemmer. Information Processing & Management, 51(1), 68-91.

[2]Porter, M. F. (1980). An algorithm for suffix stripping. Program, 14(3), 130-137.

[3]Lovins, J. B. (1968). Development of a stemming algorithm.

[4]Paice, C. D. (1994, August). An evaluation method for stemming algorithms. In Proceedings of the 17th annual international ACM SIGIR conference on Research and development in information retrieval (pp. 42-50). Springer-Verlag New York, Inc..

[5]Weiss, D. (2005). Stempelator: A hybrid stemmer for the Polish language. Institute of Computing Science: Poznan University of Technology Research Report.

[6]Mishra, U., & Prakash, C. (2012). MAULIK: An effective stemmer for Hindi language. International Journal on Computer Science and Engineering, 4(5), 711.

[7]Dhawan, C., Singh, J., & Garg, K. (2013). Hybrid Approach for Stemming in Punjabi. International Journal of Computer Science & Communication Networks, 3(2), 101.

[8]Jiandani, K. S. D., & Bhattacharyya, P. (2011, November). Hybrid inflectional stemmer and rule-based derivational stemmer for gujarati. In Proceedings of the 2nd Workshop on South and Southeast Asian Natural Language Processing (WSSANLP 2011) (p. 1).

[9]Wiese, A., Ho, V., & Hill, E. (2011, September). A comparison of stemmers on source code identifiers for software search. In Software Maintenance (ICSM), 2011 27th IEEE International Conference on (pp. 496-499). IEEE.

[10]Moral, C., de Antonio, A., Imbert, R., & Ramírez, J. (2014). A survey of stemming algorithms in information retrieval. Information Research: An International Electronic Journal, 19(1), n1.

[11]Flores, F. N., & Moreira, V. P. (2016). Assessing the impact of Stemming Accuracy on Information Retrieval–A multilingual perspective. Information Processing & Management, 52(5), 840-854.