My use requires a mroe correct processing of language than what you define as a stemmer. My experience with stemmers is that even with some words without a stem, it makes a new word from it. I consider those false positives.
My approach is based on the need to recognize that walk, walked, walking all refer to the same lemma "walk" as is correct in grammar (not some stemmer algorithm choice). It scales fine. In fact, I use lucene with Instantiated in-memory index to perform the lookups, but one could easily use MySQL or something else. Darren > > I am curious: > The idea behind a stemmer is not that he produces the correct infinitive > for > a given word. The idea is that he produces always the same infintive for > any > derivate of the word. > > What would be, if there is an unknown word? For example something like > slang? How does your solution works here? Does it scale? > > Thank you for sharing experiences. :) > > - Mitch > -- > View this message in context: > http://n3.nabble.com/LucidWorks-Solr-tp727341p730059.html > Sent from the Solr - User mailing list archive at Nabble.com. >
