ge.  Snowball now provides stemming algorithms for
    many languages (see the <A
HREF="http://snowball.tartarus.org"
TARGET="_top"
>Snowball
    site</A
> for more information).  Each algorithm understands how to
    reduce common variant forms of words to a base, or stem, spelling within
    its language.  A Snowball dictionary requires a <TT
CLASS="LITERAL"
>language</TT
>
    parameter to identify which stemmer to use, and optionally can specify a
    <TT
CLASS="LITERAL"
>stopword</TT
> file name that g