I have received a few inquires about my new query parser. I apologize
for making that announcement a little premature. My current
implementation only allows simple mixing of proximity queries with
boolean queries...complex mixing would result in an incorrect search. A
reply to my first email
Mark --
Don't lose hope! We are migrating from Verity to Lucene, and I know for
a fact that we will have to support the kind of complex queries you talk
about; maybe not /quite/ as complex as your magnificent:
cop | fowl (fowl | priest man) ! helicopter ~8 (hillary | tom)
but certainly
Mark --
Yes please! I'm very interested in the mixing of boolean and proximity
operators. I have also worked on a parser (using JavaCC) but haven't
managed to crack queries such as:
((a OR b) AND c) NEAR (d NOT e)
I can get the parse tree okay, but haven't figured out how to translate
that
Is anyone interested in helping me test out a new query parser (i.e is
anyone interested in using this, thereby helping me test it) ?
The parser uses a intermediate parse tree representation, unlike Lucene's
Query Filter.
The syntax:
date[april 6, 1992] field2,field3[parrot ~3s yore] | ((cat
On Aug 21, 2006, at 3:39 PM, Mark Miller wrote:
Is anyone interested in helping me test out a new query parser (i.e is
anyone interested in using this, thereby helping me test it) ?
I'm definitely interested in giving it a try. The syntax looks nice.
~5p is a 'within 5 paragraphs'
~6s is
Great, I will get something ready to be given out within a day or so then.
Paragraph/Sent prox support is one thing I really need to test and improve.
The parapraph and sentence search uses a SpanWithinQuery. This is just a
SpanNotQuery that can span a specified number of times instead of not
