lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Doug Cutting <>
Subject RE: Status of proximity in query language
Date Mon, 18 Feb 2002 20:50:52 GMT
> From: Brian Goetz []
> 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
  ((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...


To unsubscribe, e-mail:   <>
For additional commands, e-mail: <>

View raw message