> From: Brian Goetz [mailto:[EMAIL PROTECTED]] > > We'd need to elevate the concept of 'slop' up the query > hierarchy so you > could apply slop to arbitrary queries. Doug, is that practical?
Not without substantially revising the search code. And I'm not sure how this could be done efficiently. Consider something like: ((a AND b) OR (c AND d)) NEAR20 ((e AND f) OR (g AND h)) when there are lots of occurences of all of these terms in a document. The conditions for a match are clear, but how can one find a match using an inverted index without evaluating all combinations of occurrences? Perhaps there's way... Doug -- To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]> For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
