The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
The Porter stemming algorithm: then and now
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. \n \nDesign: Review of literature and research involving use of the Porter algorithm. \n \nFindings: 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. \n \nValue: 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. \n
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An algorithm for suffix stripping
Porter, M. F. (1980) · Program · doi:10.1108/eb046814 · Cited by 8,096
Development of a Stemming Algorithm
Lovins, J. B. (1968) · Mech. Transl. Comput. Linguistics · Cited by 1,115
Harman, D. (1991) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199101)42:1<7::aid-asi2>3.0.co;2-p · Cited by 381
Stemming algorithms: A case study for detailed evaluation
Hull, D. A. (1996) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199601)47:1<70::aid-asi7>3.3.co;2-q · Cited by 369
Viewing morphology as an inference process
Krovetz, R. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00101-0 · Cited by 70
Cited by
Industrial Artificial Intelligence in Industry 4.0 - Systematic Review, Challenges and Outlook
Peres, R. S., Jia, X., Lee, J., Sun, K., Colombo, A. W., & Barata, J. (2020) · IEEE Access · doi:10.1109/access.2020.3042874 · Cited by 693
Machine Learning-Based Sentiment Analysis for Twitter Accounts
Hasan, A., Moin, S., Karim, A., & Shamshirband, S. (2018) · Mathematical and Computational Applications · doi:10.3390/mca23010011 · Cited by 447
Rustam, F., Khalid, M., Aslam, W., Rupapara, V., Mehmood, A., & Choi, G. S. (2021) · PLOS ONE · doi:10.1371/journal.pone.0245909 · Cited by 313
Text Mining in Organizational Research
Kobayashi, V. B., Mol, S. T., Berkers, H. A., Kismihók, G., & Den Hartog, D. N. (2018) · Organizational Research Methods · doi:10.1177/1094428117722619 · Cited by 275
Big code != big vocabulary: open-vocabulary models for source code
Karampatsis, R.-M., Babii, H., Robbes, R., Sutton, C., & Janes, A. (2020) · Proceedings of the ACM/IEEE 42nd International Conference on Software Engineering · doi:10.1145/3377811.3380342 · Cited by 182
Metadata
- Authors
- Willett, P.
- Venue
- Program
- Publisher
- Emerald
- Published
- 2006-07
- Volume
- 40
- Issue
- 3
- Pages
- 219-223
- ISSN
- 0033-0337 (ISSN-L)
- OpenAlex
- W1993318811
- Cited by
- 406
- References
- 5
- FWCI
- 1.53
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: The Porter stemming algorithm: then and now. https://app.cochat.ai/papers/10.1108/00330330610681295
- The paper
- Willett, P. (2006). The Porter stemming algorithm: then and now. Program. https://doi.org/10.1108/00330330610681295
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.