On Tue, 30 May 2000, Gilles Detillieux wrote:
> The problem is that the fuzzy match algorithms are only applied to the
> original search words, and not to the results of other fuzzy matches.
> I think this makes sense for some of the algorithms, such as regex,
> prefix and substring, but for algorithms like endings, synonyms, accents,
> and perhaps speling, it would be nice to have the option of chaining
> them to get more variations.
>
> Whether we can solve this will depend on whether someone with enough
> understanding of the way fuzzy matches are expanded can find the time
> to implement this. In any case, it should go on the TODO list.
This is a good idea. I'm going to try to get the new ParseTree framework
up ASAP now that my copy of the source works (compiler bug). This would be
fairly reasonable inside the new framework, but I will probably start off
just ensuring current functionality is supported.
--
-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.
