Suffix Stripping Problem as an Optimization Problem
Information Retrieval
2013-12-25 v1 Computation and Language
Abstract
Stemming or suffix stripping, an important part of the modern Information Retrieval systems, is to find the root word (stem) out of a given cluster of words. Existing algorithms targeting this problem have been developed in a haphazard manner. In this work, we model this problem as an optimization problem. An Integer Program is being developed to overcome the shortcomings of the existing approaches. The sample results of the proposed method are also being compared with an established technique in the field for English language. An AMPL code for the same IP has also been given.
Cite
@article{arxiv.1312.6802,
title = {Suffix Stripping Problem as an Optimization Problem},
author = {B. P. Pande and Pawan Tamta and H. S. Dhami},
journal= {arXiv preprint arXiv:1312.6802},
year = {2013}
}
Comments
14 pages, 4 tables