Years ago when I programmed networking applications in Perl, I decided I had mastered regular expressions. I hadn't, of course, but when your code looks like you accidentally opened up a .dll in notepad, you have to believe in something.
Here's a basic demo I put together:
There are a couple things to note. Firstly, the demo shows exactly which steps are changing the word. If you read the paper, you'll know what I mean. Secondly, I've included a dictionary of about 25,000 words. It runs these words through the stemmer and compares them to already verified results, thereby assuring you that my algorithm really works :).
If you're interested in the source, head over to github.