lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Paul Elschot <>
Subject Re: regex-based query contribution
Date Fri, 14 Oct 2005 06:55:24 GMT
On Friday 14 October 2005 08:29, Chris Hostetter wrote:
> : A more general solution would be to use a subclass of BooleanQuery that
> : provides a Weight that flattens all the weights of the subqueries, for 
> : to the maximum weight, and for the rest works like the usual Weight of
> : BooleanQuery.
> I'm not grasping all of the ideas in this thread completley, but I
> just wanted to point out that what you are describing sounds similar to a
> MaxDisjunctionQuery (JIRA seems to be down right now, so i can't fine
> the issue number).
> It's never really occured to me before, but I think MaxDisjunctionQuery
> could be a good choice for expanded queries.  If my mental JVM is right,
> it wouldn't result in inflated scores for documents that match a few "less
> common" expanded Terms instead of many common Terms.

MaxDisjunctionQuery scores with the maximum of the scores of the
subqueries, but idf "flattening" affects the weights of the subqueries.

Paul Elschot

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

View raw message