Natural Language Processing · Level 2 of 5
Stemming
Reducing word forms using heuristic character-removal rules.
A resulting stem need not be a valid dictionary word.
Example
A search system strips a common suffix before matching text.
Listen to the definition and example
Audio transcript
Stemming. Reducing word forms using heuristic character-removal rules. A resulting stem need not be a valid dictionary word. For example: A search system strips a common suffix before matching text.
Explore this concept
Why it matters
This helps you understand how language becomes data and where processing can lose meaning.
Start with
Related concepts
Quick recall question
Try answering before looking back at the definition.