stemming
Sign in to saveIn linguistic morphology and information retrieval, stemming is the process of reducing inflected (or sometimes derived) words to their word stem, base or root form—generally a written word form. The stem need not 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.
Wikidata facts
Show 2 more facts
- Stack Exchange tag
- stackoverflow.com/tags/stemming
- P13411
- Papua New Guinea
Sources (1)
via Wikidata · CC0
~22 min read
Article
24 sectionsContents
- Examples
- History
- Algorithms
- The production technique
- Suffix-stripping algorithms
- Additional algorithm criteria
- Lemmatisation algorithms
- Stochastic algorithms
- ''n''-gram analysis
- Hybrid approaches
- Affix stemmers
- Matching algorithms
- Language challenges
- Multilingual stemming
- Error metrics
- Applications
- Information retrieval
- Domain analysis
- Use in commercial products
- Text mining
- See also
- References
- Further reading
- External links
In linguistic morphology and information retrieval, stemming is the process of reducing inflected (or sometimes derived) words to their word stem, base or root form—generally a written word form. The stem need not 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.
A computer program or subroutine that stems word may be called a stemming program, stemming algorithm, or stemmer.