: Thanks for pointing me at the DisjunctionMaxQuery, though you're
: correct, this is close but not exactly what I want.
:
: I think the difference lies in that it's not which subexpression had
: the greater score, but that a normally lower scoring document should
: get its rank elevated becaus
On Aug 14, 2007, at 11:57 AM, Walt Stoneburner wrote:
Grant,
Thanks for pointing me at the DisjunctionMaxQuery, though you're
correct, this is close but not exactly what I want.
I think the difference lies in that it's not which subexpression had
the greater score, but that a normally low
Grant,
Thanks for pointing me at the DisjunctionMaxQuery, though you're
correct, this is close but not exactly what I want.
I think the difference lies in that it's not which subexpression had
the greater score, but that a normally lower scoring document should
get its rank elevated because i
Have a look at the DisjunctionMaxQuery class. I don't think it is
exactly what you are looking for, but it might give you some ideas on
how to proceed, as it sounds similar to what you are trying to do.
Hope this helps,
Grant
On Aug 13, 2007, at 2:20 PM, Walt Stoneburner wrote:
Here's a s
Here's a scenario I just ran into, though I don't know how to make
Lucene do it (or even if it can).
I have two lists; to keep things simply lets assume (A B C D E F G) and (X Y).
I want to form a query so that when matches appear from both lists,
results rank higher, than if many elements matche
