Artificial Intelligence for Big Data

Lovins stemming

In 1968, Lovins JB published this stemming algorithm. The approach taken by Lovins is bit different, but it does start with removing suffixes from the word. It comes to the conclusion in a two-step process. It first removes the longest possible suffix from a word. It is a single-pass algorithm that removes the single largest suffix from a word. Secondly, it applies set of rules on the resulting longest suffix to transform it into a word. This algorithm is rules- and dictionary-based. It is faster and usually is less memory intensive. It is able to convert words such as getting into get or words such as mice to mouse. Sometimes this algorithm can be inaccurate due to many suffixes not available in its dictionary. Moreover, ...