Porter Stemmer's “Opposite” Algorithm?

Question

I'm looking for a way to run the opposite Porter Stemmer algorithm , that is, the string "search" will return an array of "search, search, search, etc."

Is there something similar already (pref in php)?

Thank you for your help!

Answer 1

I'm not sure if this is the direction you want to go, but I would take a dictionary file (Mac and nix machines usually have one in /usr/share/dict/words) and load it into an easy-to-see repository mechanism.

Then I compiled the list of suffixes and the program into the rules that apply to suffixes .

.