The Porter stemming algorithm: Then and now

Program

Volumn 40, Issue 3, 2006, Pages 219-223

  Willett, Peter ^a  

^a UNIVERSITY OF SHEFFIELD   (United Kingdom)

Author keywords

Information retrieval; Programming and algorithm theory

Indexed keywords

EID: 33746584018     PISSN: 00330337     EISSN: None     Source Type: Journal    
DOI: 10.1108/00330330610681295     Document Type: Article

References (15)

1. Ahmad, F., Yusoff, M. and Sembok, T.M.T. (1996), "Experiments with a stemming algorithm for Malay words", Journal of the American Society for Information Science, Vol. 47 No. 12, pp. 909-18.
2. Dolby, J.L. and Resnikoff, H.L. (1964), "On the structure of written English", Language, Vol. 40 No. 2, pp. 167-96.
3. Frakes, W.B. and Fox, C.J. (2003), "Strength and similarity of affix removal stemming algorithms", SIGIR Forum, Vol. 37, pp. 26-30, available at: www.sigir.org/forum/S2003/StemSim.pdf (accessed 18 April 2006).
4. Harman, D. (1991), "How effective is suffixing?", Journal of the American Society for Information Science, Vol. 42 No. 1, pp. 7-15.
5. Hooper, R. and Paice, C. (2005), "The Lancaster stemming algorithm", available at: www.comp.lancs.ac.uk/computing/research/stemming/ (accessed 18 April 2006).
6. Hull, D.A. (1996), "Stemming algorithms: a case study for detailed evaluation", Journal of the American Society for Information Science, Vol. 47 No. 1, pp. 70-84.
7. Krovetz, B. (2000), "Viewing morphology as an inference process", Artificial Intelligence, Vol. 118 Nos 1/2, pp. 277-94.
8. Lennon, M., Peirce, D.S., Tarry, B.D. and Willett, P. (1981), "An evaluation of some conflation algorithms for information retrieval", Journal of Information Science, Vol. 3 No. 4, pp. 177-83.
9. Lovins, J.B. (1968), "Development of a stemming algorithm", Mechanical Translation and Computational Linguistics, Vol. 11 Nos 1/2, pp. 22-31.
10. Porter, M.F. (1980), "An algorithm for suffix stripping", Program, Vol. 14 No. 3, pp. 130-7.
11. Porter, M.F. (2001), "Snowball: a language for stemming algorithms", available at: www.snowball.tartarus.org/texts/introduction. html (accessed 18 April 2006).
12. Porter, M.F. (2005), "Lovins revisited", in Tait, J.I. (Ed.), Charting a New Course: Natural Language Processing and Information Retrieval. Essays in Honour of Karen Spärck Jones, Springer, Dordrecht, pp. 39-68.
13. Porter, M.F. (2006), "Stemming algorithms for various European languages", available at: www.snowball.tartarus.org/texts/stemmersoverview. html (accessed 18 April).
14. Schinke, R., Greengrass, M., Robertson, A.M. and Willett, P. (1996), "A stemming algorithm for Latin text databases", Journal of Documentation, Vol. 52 No. 2, pp. 172-87.
15. Sproat, R. (1992), Morphology and Computation, MIT Press, Cambridge, MA.