{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T19:41:00Z","timestamp":1777146060354,"version":"3.51.4"},"reference-count":7,"publisher":"Emerald","issue":"3","license":[{"start":{"date-parts":[[2006,7,1]],"date-time":"2006-07-01T00:00:00Z","timestamp":1151712000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006,7,1]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-heading\">Purpose<\/jats:title><jats:p>The automatic removal of suffixes from words in English is of particular interest in the field of information retrieval. This work was originally published in <jats:italic>Program<\/jats:italic> in 1980 and is republished as part of a series of articles commemorating the 40th anniversary of the journal.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Design\/methodology\/approach<\/jats:title><jats:p>An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Findings<\/jats:title><jats:p>Although simple, it performs slightly better than a much more elaborate system with which it has been compared. It effectively works by treating complex suffixes as compounds made up of simple suffixes, and removing the simple suffixes in a number of steps. In each step the removal of the suffix is made to depend upon the form of the remaining stem, which usually involves a measure of its syllable length.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-heading\">Originality\/value<\/jats:title><jats:p>The piece provides a useful historical document on information retrieval.<\/jats:p><\/jats:sec>","DOI":"10.1108\/00330330610681286","type":"journal-article","created":{"date-parts":[[2006,7,27]],"date-time":"2006-07-27T19:46:40Z","timestamp":1154029600000},"page":"211-218","source":"Crossref","is-referenced-by-count":203,"title":["An algorithm for suffix stripping"],"prefix":"10.1108","volume":"40","author":[{"given":"M.F.","family":"Porter","sequence":"first","affiliation":[]}],"member":"140","reference":[{"key":"key2022021720470325500_b2","unstructured":"Andrews, K. (1971), \u201cThe development of a fast conflation algorithm for English\u201d, dissertation for the Diploma in Computer Science, Computer Laboratory, University of Cambridge."},{"key":"key2022021720470325500_b7","unstructured":"Cleverdon, C.W., Mills, J. and Keen, M. (1966), Factors Determining the Performance of Indexing Systems, 2 vols, College of Aeronautics, Cranfield."},{"key":"key2022021720470325500_b5","unstructured":"Colombo, D.S. and Niehoff, R.T. (n.d.), Final report on improved access to scientific and technical information through automated vocabulary switching, NSF Grant No. SIS75\u201012924 to the National Science Foundation."},{"key":"key2022021720470325500_b4","unstructured":"Dattola, R.T. (1975), First: Flexible Information Retrieval System for Text, Xerox Corporation, Webster, NY, 12 December."},{"key":"key2022021720470325500_b6","unstructured":"Dawson, J.L. (1974), \u201cSuffix removal and word conflation\u201d, ALLC Bulletin, Michaelmas, pp. 33\u201046."},{"key":"key2022021720470325500_b1","unstructured":"Lovins, J.B. (1968), \u201cDevelopment of a stemming algorithm\u201d, Mechanical Translation and Computational Linguistics, Vol. 11 No. 1, pp. 22\u201031."},{"key":"key2022021720470325500_b3","unstructured":"Petrarca, A.E. and Lay, W.M. (1969), \u201cUse of an automatically generated authority list to eliminate scattering caused by some singular and plural main index terms\u201d, Proceedings of the American Society for Information Science, Vol. 6, pp. 277\u201082."}],"container-title":["Program"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/00330330610681286\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/00330330610681286\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:55:18Z","timestamp":1753401318000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/40\/3\/211-218\/330214"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,1]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,7,1]]}},"alternative-id":["10.1108\/00330330610681286"],"URL":"https:\/\/doi.org\/10.1108\/00330330610681286","relation":{},"ISSN":["0033-0337"],"issn-type":[{"value":"0033-0337","type":"print"}],"subject":[],"published":{"date-parts":[[2006,7,1]]}}}