At 10:55 PM -0400 5/10/00, Carey Bunks wrote:
>using htdig. I was wondering if someone could point me to the
>algorithm which describes how the list of words are generated from the
>initial key. I already know about stemming and Porter's algorithm, but
>this doesn't seem like the right approach.
See the htfuzzy directory. In ht://Dig's case, the endings algorithm
you describe requires you to create two databases for mapping word to
roots and then roots to words. You'll want to see the Endings* files
in particular.
You may also find the Synonyms algorithm to your liking.
Remember (of course) that ht://Dig is licensed under the GPL. Judging
from your domain name, this doesn't seem to be a likely problem. :-)
--
-Geoff Hutchison
Williams Students Online
http://wso.williams.edu/
------------------------------------
To unsubscribe from the htdig mailing list, send a message to
[EMAIL PROTECTED]
You will receive a message to confirm this.
