Hello Chris,
Thanks a lot for the helping hand.
I plugged in MaxDisjunctQuery and it is working so far, but I
need to check accuracy of it. Next problem I met is highlighter, which
must be adopted to understand MaxDisjunctQuery(because now it stops to
highlight anything due to unknown new Query t
: I have n fields, for simplicity let's say 3: f1, f2, f3.
: I have an AND query with m words in it, lets' also simplify: w1, w2, w3.
:
: To cover all possible cases I should finally have the following
: BooleanQuery:
it really depends on what you want. if I understand what you mean in the
below
t; patch...
CH> http://issues.apache.org/jira/browse/LUCENE-323
CH> : Date: Mon, 24 Oct 2005 20:13:55 +0300
CH> : From: Maxim Patramanskij <[EMAIL PROTECTED]>
CH> : Reply-To: java-user@lucene.apache.org, Maxim Patramanskij <[EMAIL
PROTECTED]>
CH> : To: java-user@lucene.apach
AIL PROTECTED]>
: Reply-To: java-user@lucene.apache.org, Maxim Patramanskij <[EMAIL PROTECTED]>
: To: java-user@lucene.apache.org
: Subject: Cross-field multi-word and query
:
:
: I have the following problem:
:
: I need to construct programmatically a Boolean query against n fields
: having m words
I have the following problem:
I need to construct programmatically a Boolean query against n fields
having m words in my query.
All possible unique combinations(sub-queries) are disjunctive between
each other while boolean clauses of each combination combines with AND
operator.
The reason of su