Menu
I'm looking for some way of performing the opposite of a Porter Stemmer algorithm, i.e. the string "search" would return an array "searches, searched, searching etc.."
Does something like this exist already (pref in php)?
Thank you for your help!
680
Snowball Stemmer is also known as the Porter2 stemming algorithm because it is a better version of the Porter Stemmer. It is more aggressive than Porter Stemmer.
stemming algorithms can be classified in three groups: truncating methods, statistical methods, and mixed methods. Each of these groups has a typical way of finding the stems of the word variants.
Snowball stemmer: This algorithm is also known as the Porter2 stemming algorithm. It is almost universally accepted as better than the Porter stemmer, even being acknowledged as such by the individual who created the Porter stemmer.
Lancaster Stemmer is the most aggressive stemming algorithm. It has an edge over other stemming techniques because it offers us the functionality to add our own custom rules in this algorithm when we implement this using the NLTK package. This sometimes results in abrupt results.
I'm not sure if this is the direction that you're looking to go but I would grab a file of dictionary words (Mac and nix machines usually have one at /usr/share/dict/words) and load it into an easily searched storage mechanism.
Next, I'd compile a list of suffixes and program in the rules applied to suffixes.
In regard to the actual question asked I have not found anything that exists like this already.
121
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
