Generation, Implementation and Appraisal of an N-gram based Stemming Algorithm
Information Retrieval
2014-01-17 v2 Computation and Language
Abstract
A language independent stemmer has always been looked for. Single N-gram tokenization technique works well, however, it often generates stems that start with intermediate characters, rather than initial ones. We present a novel technique that takes the concept of N gram stemming one step ahead and compare our method with an established algorithm in the field, Porter's Stemmer. Results indicate that our N gram stemmer is not inferior to Porter's linguistic stemmer.
Cite
@article{arxiv.1312.4824,
title = {Generation, Implementation and Appraisal of an N-gram based Stemming Algorithm},
author = {B. P. Pande and Pawan Tamta and H. S. Dhami},
journal= {arXiv preprint arXiv:1312.4824},
year = {2014}
}
Comments
10 pages