In a recent post to his blog Sameer looks at implementing a Stemming algorithm to search an array of words.
It uses this library (as written by Richard Heyes).
A stemming algorithm lets you reduce each English input word to its basic root or stem (e.g.
'walking' to 'walk') so that variations on a word ('walks', 'walked', 'walking') are considered equivalent when searching.
This stems can than be used in a search query rather than the...
Post new comment