I need to perform stemming in my application, but mostly for a small subset of stems. I.e. to check if a given word is of a certain stem out of a small list of stem words. Maybe a hundred stem words only. There's few stemming projects out there, but they all look a bit huge. I am looking for one that is lightweight and predictable, that is preferrably based on a definite list of words belonging to each stem, not on a heursitc algorithm.
That's because I assume large stemming packages rely more on algorithm (total newbie assumption) rather than holding databases of words, and thus their results may be a bit heuristic and less accurate.
Does anyone know of such a software package, that stems by a 'dictionary' of words, or any open database that can be derived from, for the same purpose?
a package can be better than a database, if it's speedy for large volume processing, as I need to figure, in my application, whether each and every word of a given long text, has the same stem as any of a short list of stem words, which requires an efficient algorithm.