References

W1 Frakes & Fox. 2003. Strength and Similarity of Affix Removal Stemming Algorithms http://www.sigir.org/forum/S2003/StemSim.pdf
W2 M. D. McIlroy. 1982. Development of a Spelling List. AT&T Bell Laboratories http://unix-spell.googlecode.com/svn/trunk/McIlroy_spell_1982.pdf
W3 Unix Spell https://en.wikipedia.org/wiki/Spell_(Unix)
W4 Levenshtein distance

http://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance

W5 Lovins Stemmer http://mt-archive.info/MT-1968-Lovins.pdf
W6 Hull David A. Stemming Algorithms_-A Case Study for Detailed Evaluation. Rank-Xerox Research Centre. 1995 http://www.inf.ed.ac.uk/teaching/courses/tts/papers/hull96stemming.pdf
W7 Yamout F. Further Enhancement to the Porter's Stemming Algorithm. C E American Univ. Lebanon. 2004. http://www2.cs.uni-paderborn.de/cs/ag-klbue/en/workshops/tir-04/proceedings/yamout04-further-enhancement-porter-stemming.pdf
W8 Chris Paice. 'Method for Evaluation of Stemming Algorithms Based on Error Counting' JASIS 47(8), August 1996 http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.89.9560%26rep%3Drep1%26type%3Dpdf