My First Algorithm in Haskell - Step 1  This is a continuation
of a series of posts starting here. I've been implementing
Porter's stemming algorithm in Haskell in order to learn
Haskell. I normally wouldn't learn a language this way, but as I
stated in the last post I haven't yet been able to find an
excuse to build something else in the language.  This algorithm
is broken down into 5 steps which process a word in order. I'll
describe how I tackled step one in a moment. Before I do, I'll
go over some of the foundational parts of the algorithm that we
need in place before we go through the steps.  The first two
functions here were described in more detail in the last post.
To recap: The first rotates a string one character to the right.
The second determines which letters in a word are consonants or
vowels. How this is would likely be handled in an imperative
language would be to keep track of the index of the letter we're
currently evaluating so we could subtract 1 from that index and
check the previous lett