Porter stemmer
Year: 1,980
Journal: Program
Languages: English
Programming languages: awk, C, clojure, D, Delphi, erlang, flex, Go, Groovy, Haskell, Java, JavaScript, Julia, Lisp, Matlab, MySQL, node.js, ooRexx, Perl, php, Prolog, Python, R, REBOL, Ruby, Rust, sas, Scala, T-SQL, Tcl, vala, Visual Basic, XSLT
Input data:
word, e.g. “arguing”
Output data:
stemmed word, e.g. “argu” (note, that “argu” is not a word, it is just a stemmed (normalized) version of “arguing”, “argued”, etc.)
Project website: https://tartarus.org/martin/PorterStemmer/
The Porter stemming algorithm is a process for removing the commoner morphological and inflexional endings from words in English. Its main use is as part of a term normalisation process that is usually done when setting up Information Retrieval systems.