The Porter stemming algorithm: then and now
Top Cited Papers
- 1 July 2006
- journal article
- Published by Emerald in Program: electronic library and information systems
- Vol. 40 (3), 219-223
- https://doi.org/10.1108/00330330610681295
Abstract
Purpose – In 1980, Porter presented a simple algorithm for stemming English language words. This paper summarises the main features of the algorithm, and highlights its role not just in modern information retrieval research, but also in a range of related subject domains. Design/methodology/approach – Review of literature and research involving use of the Porter algorithm. Findings – The algorithm has been widely adopted and extended so that it has become the standard approach to word conflation for information retrieval in a wide range of languages. Orinality/value – The 1980 paper in Program by Porter describing his algorithm has been highly cited. This paper provides a context for the original paper as well as an overview of its subsequent use.Keywords
This publication has 11 references indexed in Scilit:
- Lovins RevisitedPublished by Springer Science and Business Media LLC ,2005
- Strength and similarity of affix removal stemming algorithmsACM SIGIR Forum, 2003
- Viewing morphology as an inference processArtificial Intelligence, 2000
- Experiments with a stemming algorithm for Malay wordsJournal of the American Society for Information Science, 1996
- A STEMMING ALGORITHM FOR LATIN TEXT DATABASESJournal of Documentation, 1996
- Stemming algorithms: A case study for detailed evaluationJournal of the American Society for Information Science, 1996
- How effective is suffixing?Journal of the American Society for Information Science, 1991
- An evaluation of some conflation algorithms for information retrievalJournal of Information Science, 1981
- An algorithm for suffix strippingProgram: electronic library and information systems, 1980
- On the Structure of Written English WordsLanguage, 1964