An algorithm for suffix stripping

• M.F. Porter

抄録

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.

収録刊行物

• Program

  Program 14 (3), 130-137, 1980-03-01

  Emerald

キーワード

• Library and Information Sciences
• Information Systems

詳細情報

• CRID: 1361418518946144384
• NII論文ID: 80000754746
• DOI: 10.1108/eb046814
• ISSN: 00330337
• ISSN: http://id.crossref.org/issn/03064379
• ISSN: http://id.crossref.org/issn/00330337
• Web Site: https://www.emerald.com/insight/content/doi/10.1108/eb046814/full/xml
• Web Site: https://www.emerald.com/insight/content/doi/10.1108/eb046814/full/html
• データソース種別:
  • Crossref
  • CiNii Articles