Skip to content

An algorithm for suffix stripping

Martin Porter

Data Technologies and Applications · 1980 · 8,184 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Porter, M. (1980). An algorithm for suffix stripping. Data Technologies and Applications, 14(3), 130–137. https://doi.org/10.1108/eb046814

In text: (Porter, 1980)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

The automatic removal of suffixes from words in English is of particular interest in the field of information retrieval. An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL. 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.

  1. Gapped BLAST and PSI-BLAST: a new generation of protein database search programs1997
  2. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome2009
  3. MAFFT: a novel method for rapid multiple sequence alignment based on fast Fourier transform2002
  4. Introduction to Algorithms1991
  5. Fast and accurate long-read alignment with Burrows–Wheeler transform2010

Metadata from OpenAlex (CC0). Citations are generated from the published record.