Saved in:
| Main Author: | |
|---|---|
| Format: | Recurso educativo Open Access |
| Language: | en |
| Published: |
2006
|
| Subjects: | |
| Online Access: | https://eric.ed.gov/?id=EJ901960 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1867181726809194497 |
|---|---|
| author | Porter, M. F. |
| author_facet | Porter, M. F. Porter, M. F. |
| collection | Education Resources Information Center |
| contents | An Algorithm for Suffix Stripping Porter, M. F. Mathematics Information Retrieval Automation Suffixes English 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. |
| format | Recurso educativo Open Access |
| id | eric_EJ901960 |
| institution | ERIC Institute of Education Sciences |
| language | en |
| publishDate | 2006 |
| record_format | eric |
| spellingShingle | An Algorithm for Suffix Stripping Porter, M. F. Mathematics Information Retrieval Automation Suffixes English An Algorithm for Suffix Stripping Porter, M. F. Mathematics Information Retrieval Automation Suffixes English 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. |
| title | An Algorithm for Suffix Stripping |
| topic | Mathematics Information Retrieval Automation Suffixes English |
| url | https://eric.ed.gov/?id=EJ901960 |