This format we call original . Development of a Stemming Algorithm. Mechanical Translation and Computational Linguistics . J. B. Lovins. Development of a Stemming Algorithm.
Terms match if they have a common root.
For example, trains might be stemmed to train , which would match train , training , and of course trains . Each word thus has a set of conflations , that is, words that have the same root. Porter s method. Each step results in the removal of a suffix or the transformation of the root. Lovins s method.