stemming algorithm

Also found in: Thesaurus, Encyclopedia, Wikipedia.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Noun1.stemming algorithm - an algorithm for removing inflectional and derivational endings in order to reduce word forms to a common stem
algorithm, algorithmic program, algorithmic rule - a precise rule (or set of rules) specifying how to solve some problem
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.
References in periodicals archive ?
QPS makes use of Morphological analyzer [26] and Porter's stemming algorithm [27] to establish relation between the words and stemming of the words to its root.
A stemming algorithm is a method of linguistic normalization, which the alternative forms of a word are condensed to a frequent form, for example, relationship relations relative > relates related relating It is mainly to understand that we use stemming with the purpose of improving the performance of IR systems.
For instance, the words "argue," "argued," and "argues" might reduce to the stem "argu." In this research we use the well-known Porter stemming algorithm as included in Rehdrek's (2010) Gensim software.
The most widely used algorithm for stemming words is Porter's Stemming Algorithm, proposed in the 1980 article "An Algorithm for Suffix Stripping" (Porter, 1980).
Immediately after he does that, the system parses the documents, applies the stemming algorithm and the TFIDF formulas and ultimately extracts the most important five key concepts from each file: C11-C15, C21-C25.
The Porter Stemming Algorithm [19] is used in this research to stem text.
In case of Turkish messages, fixed-prefix stemming algorithm [25] is employed, whereas well-known Porter stemming algorithm [26] is utilized for the messages in English.
One of Porter's most important contributions to information retrieval was his stemming algorithm, initially developed in 1979 by Porter, Keith van Rijsbergen, and Robertson.