[Snowball-discuss] restoring a stemmed word

[Ronald Muller]

Hi,

Take a look at affix compression as used by ispell and MySpell. You can find
information about ispell and MySpell at
<a
href="http://fmg-www.cs.ucla.edu/fmg-members/geoff/ispell.html">Internationa
l Ispell</a> and <a
href="http://whiteboard.openoffice.org/lingucomponent/dictionary.html">OpenO
ffice Lingucomponent Sub-Project: Spell Checking and Dictionaries</a>.

What is your target language, Java (ispell and MySpell are written in C)?

Regards,

Ronald

----- Original Message -----
From: "Alexandra Elizabeth Duncan" <aed02@doc.ic.ac.uk>
To: <snowball-discuss@lists.tartarus.org>
Sent: Friday, July 04, 2003 2:56 PM
Subject: [Snowball-discuss] restoring a stemmed word


> Hi
> I am an MSc student at Imperial College and for my thesis I am writing a
> language translator for a mobile phone (english-french).  The idea is to
> have the dictionary stored on the phone but as the memory available is
> quite small, I will need to compress the words.
>
> For the first stage of compression, I am intending to stem the words as
> this seems very suitable but this means that I will need to restore the
> words to their unstemmed form in order to display the result to the user.
>
> I haven't seen any mention of ways to restore a stemmed word and I was
> wondering if there are similar rules for doing so, and/or can one
> reverse the algorithm to restore a word back to its full form?
>
> Any advice or pointers to reading material on this would be greatly
> appreciated.
>
> Regards
> Alexandra Duncan
> Imperial  College, London
>
>
> _______________________________________________
> Snowball-discuss mailing list
> Snowball-discuss@lists.tartarus.org
> http://lists.tartarus.org/mailman/listinfo/snowball-discuss