To read this content please select one of the options below:

An algorithm for suffix stripping

M.F. Porter (Computer Laboratory, Cambridge, UK)

Program: electronic library and information systems

ISSN: 0033-0337

Article publication date: 1 July 2006

2814

Abstract

Purpose

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 Program in 1980 and is republished as part of a series of articles commemorating the 40th anniversary of the journal.

Design/methodology/approach

An algorithm for suffix stripping is described, which has been implemented as a short, fast program in BCPL.

Findings

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.

Originality/value

The piece provides a useful historical document on information retrieval.

Keywords

Citation

Porter, M.F. (2006), "An algorithm for suffix stripping", Program: electronic library and information systems, Vol. 40 No. 3, pp. 211-218. https://doi.org/10.1108/00330330610681286

Publisher

:

Emerald Group Publishing Limited

Copyright © 2006, Emerald Group Publishing Limited

Related articles