object

# `porter_stemmer(Representation)`

- `Representation` - Word representation. Valid values are `atom`, `codes`, and `chars`.

Porter stemmer algorithm implementation for English words.

Availability:
`logtalk_load(stemming(loader))`
Author: Paulo Moura
Version: 1:0:0
Date: 2026-02-05
Compilation flags:
`static, context_switching_calls`
Implements:
`public` stemmer_protocol
Uses:
integer
list
Remarks:

> - Algorithm: The Porter stemming algorithm (Porter, 1980) is a widely used algorithm for reducing English words to their root form by applying a series of rules that remove common suffixes.

> - Reference: Porter, M.F. (1980). An algorithm for suffix stripping. Program, 14(3), 130-137.

Inherited public predicates:
stem/2 stems/2

## Public predicates

(no local declarations; see entity ancestors if any)

## Protected predicates

(no local declarations; see entity ancestors if any)

## Private predicates

(no local declarations; see entity ancestors if any)

## Operators

(none)

See also

stemmer_protocol, lovins_stemmer(Representation)