[Home]PorterStemming

MeatballWiki | RecentChanges | Random Page | Indices | Categories

One of 2 algorithms by Martin Porter for stemming, i.e.: reducing English words (as well as practical) to their roots, for purposes of improving information retrieval.

It does some fairly computationally cheap manipulation to return a "stem" word for most (English) words, e.g.: "biologically" matches "biologist."

He has a Web page for his better-established algorithm:

http://www.tartarus.org/~martin/PorterStemmer/

It has numerous links to implementations in various programming languages.

By his own comparison with LovinsStemming, he traded a shorter reach (i.e.: fewer characters) to his matching and transformation rules, for dramatically more (conceptual) steps in the algorithm.

He has a separate Web page for his newer algorithm:

http://snowball.tartarus.org/algorithms/english/stemmer.html

It has links to implementations in far fewer languages.


Discussion

MeatballWiki | RecentChanges | Random Page | Indices | Categories
This page is read-only | View other revisions | Search MetaWiki
Search: