Suffix Stripping Problem as an Optimization Problem
| Autor: | H. S. Dhami, B. P. Pande, Pawan Tamta |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
FOS: Computer and information sciences
Linguistics and Language History Computer Science - Computation and Language Theoretical computer science Optimization problem Computer science AMPL Conflation Field (computer science) Computer Science - Information Retrieval Stripping (linguistics) Code (cryptography) Suffix Computation and Language (cs.CL) computer Information Retrieval (cs.IR) Integer (computer science) computer.programming_language |
| Zdroj: | Glottotheory. 6 |
| ISSN: | 2196-6907 1337-7892 |
| DOI: | 10.1515/glot-2015-0013 |
| Popis: | 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. Comment: 14 pages, 4 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|