Premium
A simple algorithm for the problem of suffix stripping
Author(s) -
Pande B. P.,
Tamta Pawan,
Dhami H. S.
Publication year - 2015
Publication title -
international journal of applied linguistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.712
H-Index - 39
eISSN - 1473-4192
pISSN - 0802-6106
DOI - 10.1111/ijal.12071
Subject(s) - suffix , stripping (fiber) , simple (philosophy) , computer science , compressed suffix array , simple algorithm , algorithm , word (group theory) , artificial intelligence , natural language processing , linguistics , suffix tree , physics , engineering , epistemology , electrical engineering , thermodynamics , philosophy
Suffix stripping is a problem of removing morphological suffixes from a word to get the stem. We present suffix stripping as an unconstrained optimization problem. Free from linguistic or morphological knowledge, a simple algorithm is being developed. Superiority of the algorithm over an established technique for English language is being demonstrated.