I'm trying to create a fairly complex SpanQuery from a binary parse tree.
I create SpanOrQueries from SpanTermQueries and combine SpanOrQueries into
BooleanQueries. So far, so good.
The problem is that I don't see how to create a SpanNotQuery from a
BooleanQuery and a SpanTermQuery. I want the Bool
Isn't a SpanAndQuery the same as a SpanNearQuery? Perhaps
with "interesting" slops..
Erick
On 8/6/07, Peter Keegan <[EMAIL PROTECTED]> wrote:
>
> I'm trying to create a fairly complex SpanQuery from a binary parse tree.
> I create SpanOrQueries from SpanTermQueries and combine SpanOrQueries i
Even without 'interesting' slops, it does appear that SpanNearQuery is a
logical AND of all its clauses.
I was distracted by the BooleanQuery examples in the javadocs :)
thanks,
Peter
On 8/6/07, Erick Erickson <[EMAIL PROTECTED]> wrote:
>
> Isn't a SpanAndQuery the same as a SpanNearQuery? Perhap
Yeah, a SpanAndQuery could easily be a SpanNearQuery if a huge distance
was allowed. I do wonder how the scoring might be different based on the
distance of the match though...
Erick Erickson wrote:
Isn't a SpanAndQuery the same as a SpanNearQuery? Perhaps
with "interesting" slops..
Erick
