Elm implementation of the classical Porter Stemming-algorithm. The algorithm is described in this paper and on Wikipedia. The implementation is inspired by the JavaScript- and the Haskell-implementation.
The module exposes a single function.
Removes a words suffixes to get the words stem.
stem "sky" == "sky"
stem "hopefulness" == "stem"