I know you have a solution already that I agree with, but I do think
the DisjunctionMaxQuery could serve as the start for writing your own
Query that did what you want. Why would you want to? Well, maybe
you have other ways you want to search as well and don't want to mess
with custom Sim
On 5/25/07, Walt Stoneburner <[EMAIL PROTECTED]> wrote:
In reading the math for scoring at the bottom of:
http://lucene.zones.apache.org:8080/hudson/job/Lucene-Nightly/javadoc/org/apache/lucene/search/Similarity.html
It appears that if I can make tf() and idf(), term frequency and
inverse docume
In reading the math for scoring at the bottom of:
http://lucene.zones.apache.org:8080/hudson/job/Lucene-Nightly/javadoc/org/apache/lucene/search/Similarity.html
It appears that if I can make tf() and idf(), term frequency and
inverse document frequency respectively, both return 1, then coord(),
w
Grant writes:
Have a look at the DisjunctionMaxQuery, I think it might help,
although I am not sure it will fully cover your case.
The definition for DisjunctionMaxQuery is provided at this URL:
http://incubator.apache.org/lucene.net/docs/2.1/Lucene.Net.Search.DisjunctionMaxQuery.html,
Grossly
Have a look at the DisjunctionMaxQuery, I think it might help,
although I am not sure it will fully cover your case.
-Grant
On May 24, 2007, at 11:22 AM, Walt Stoneburner wrote:
Hi,
I'm trying to figure what I need to do with Lucene to score a
document higher when it has a larger number of
Hi,
I'm trying to figure what I need to do with Lucene to score a
document higher when it has a larger number of unique search terms
that are hit, rather than term frequency counts.
A quick example.
If I'm searching for "BIRD CAT DOG" (all should clauses), then I want
...a document with B
