Word Stemming Algorithm
(Redirected from Stemming Algorithm)
Jump to navigation
Jump to search
A Word Stemming Algorithm is a Text Processing Algorithm that can be implemented by a Word Stemming System that can solve a Word Stemming Task.
- AKA: Stemming Algorithm, Stemmer.
- Context:
- It can make use of a Stem Dictionary.
- It can make use of a Suffix List.
- Example(s):
- Counter-Example(s):
- See: Linguistic Morphology, Information Retrieval, N-Gram Analysis, NLP Algorithm.
References
2015
- (Wikipedia, 2015) ⇒ http://en.wikipedia.org/wiki/Stemming Retrieved:2015-4-11.
- Stemming is the term used in linguistic morphology and information retrieval to describe the process for reducing inflected (or sometimes derived) words to their word stem, base or root form — generally a written word form. The stem needs not to be identical to the morphological root of the word; it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. Algorithms for stemming have been studied in computer science since the 1960s. Many search engines treat words with the same stem as synonyms as a kind of query expansion, a process called conflation.
Stemming programs are commonly referred to as stemming algorithms or stemmers.
- Stemming is the term used in linguistic morphology and information retrieval to describe the process for reducing inflected (or sometimes derived) words to their word stem, base or root form — generally a written word form. The stem needs not to be identical to the morphological root of the word; it is usually sufficient that related words map to the same stem, even if this stem is not in itself a valid root. Algorithms for stemming have been studied in computer science since the 1960s. Many search engines treat words with the same stem as synonyms as a kind of query expansion, a process called conflation.
1980
- (Porter, 1980) ⇒ Martin F. Porter. (1980). “An Algorithm for Suffix Stripping.” In: Program, 14(3):130–137.
- QUOTE: The nature of the task will vary considerably depending on whether a stem dictionary is being used, whether a suffix list is being used, and of course on the purpose for which the suffix stripping is being done.