Gilles,
Thank you for your answer.
>To quote from the documentation: (attrs.html#search_algorithm)
> Each word is first reduced to its word root and then all known legal
> endings are used for the matching.
>
>I think the bug basically comes up because there are some subset of
>permuations that are also root words. In Endings::getWords, if a word is
>already a root word, then it doesn't bother to check if it's also a
>permutation.
I'm afraid, the origin of the bug is different. I tested your idea on
one indexed Russian site (26,000 documents) and found the same bug
in the case when the word I'm searching for is not a root itself (but
have two different roots). So I guess, the program stops searching
when it finds the first occurence of the word, not all of them. (Indeed,
in Endings::getWords I don't see the loop that tests if there are other
roots.)
- Alexander
_______________________________________________
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
