Concept information
Preferred term
Porter stemming algorithm
Definition
- An algorithm to remove suffixes from words and reduce them to their stem, also taking into account the context. (Loterre)
Broader concept
Synonym(s)
- Porter stemmer
Example
- All documents and the 6 financial sentiment word lists are stemmed by the Porter stemmer (Porter 1980) and some stop words are also removed. (Tsai & Wang, 2014)
- Porter stemmer is one of the famous stemmer for English. (Patra, Debbarma, Debbarma, Das, Das & Bandyopadhyay, 2012)
- The Porter stemmer (M.F. Porter 1980) developed the stemmer on the truncation of suffixes by means of list of suffixes and some restrictions/conditions are placed to recognize the suffix to be detached and generating a valid stem. (Khan, Anwar, Bajwa & Wang, 2012)
- The second measure involves stemming which is reducing words into their base forms using the Porter stemmer (Porter 1980). (Alharbi & Gotoh, 2016)
- When computing n-gram counts we applied Porter's stemmer to all tokens. (Paul & Dredze, 2013)
In other languages
URI
http://data.loterre.fr/ark:/67375/8LP-PS2KX2H5-N
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}