Suffix Stripping Problem as an Optimization Problem
This work addresses the suffix stripping problem for information retrieval systems, but it appears incremental as it builds on existing approaches with a new modeling method.
The authors tackled the suffix stripping problem in information retrieval by modeling it as an optimization problem and developing an integer program, with sample results compared to an established technique for English language.
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.