At 3:52 AM -0400 7/31/01, Brad W. Galiette wrote:
>Exactly how does HT-Dig approach the approximate matching feature? (e.g.,
>how from the word "search" does it derive "searching", "seearches",
>"searcher" as well as others?)
There are several different algorithms, as outlined in both:
<http://www.htdig.org/attrs.html#search_algorithm>
<http://www.htdig.org/htfuzzy.html>
In the case you mentioned, the alternate endings are generated based
on the English affix rules as derived by the popular UNIX spelling
checker "ispell." Other algorithms work based on approximate phoentic
sounds, etc.
Is that a detailed enough explanation?
--
--
-Geoff Hutchison
Williams Students Online
http://wso.williams.edu/
_______________________________________________
htdig-general mailing list <[EMAIL PROTECTED]>
To unsubscribe, send a message to <[EMAIL PROTECTED]> with a
subject of unsubscribe
FAQ: http://htdig.sourceforge.net/FAQ.html
