lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Dave Seltzer <>
Subject Re: Creating Span Queries from Boolean Queries
Date Wed, 22 Aug 2012 00:37:47 GMT
Well I was hoping that someone knew of a recursive solution to
rewriting Boolean queries of arbitrary depth.

I suppose If I can rewrite

"london olympics" AND (football OR soccer) NOT nfl


"London Olympics" within_5_words_of (football or soccer)
not_within_5_words_of nfl

Then I should be able to use the same logic to operate on a
BooleanQuery occurring within a BooleanClause.


On Tue, Aug 21, 2012 at 7:26 PM, Jack Krupansky <>wrote:

> Give us an example of what you are really trying to match.
> SpanNearQuery takes a list of clauses, which can be SpanTermQuery to match
> a single term or SpanNearQuery to match a nested span. You can specify the
> maximum distance between terms/spans - use nesting if you want to change
> that distance. That gives you a basic BooleanQuery with AND clauses
> converted to spans.
> -- Jack Krupansky
> -----Original Message----- From: Dave Seltzer
> Sent: Tuesday, August 21, 2012 6:53 PM
> To:
> Subject: Creating Span Queries from Boolean Queries
> Hi Everyone,
> If there was a straightforward way to take a Boolean Query created by the
> Lucene Query Parser and convert it to a Span Query.
> Ideally I'd like to take any ANDed clauses and require them to occur
> withing $SPAN of the other ANDs.
> I can't quite wrap my head around how to solve the problem.
> Thanks!
> -Dave
> ------------------------------**------------------------------**---------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.**<>
> For additional commands, e-mail: java-user-help@lucene.apache.**org<>

Dave Seltzer <>
Chief Systems Architect
(203) 254-3600 x222

  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message