You are viewing a plain text version of this content. The canonical link for it is here.
Posted to java-user@lucene.apache.org by Andy Goodell <ag...@discoverymining.com> on 2007/06/04 23:46:30 UTC

Searching with a score cutoff

Currently our application implements a score cutoff by iterating through the
hits and then stopping once it reaches a hit whose score is below our
threshold.  We'd like to optimize this (and avoid looking at the entire hits
when we don't need to) by having the score cutoff applied when the hits are
gathered.  The only way I can see of doing this is by over-riding
Similarity, which seems like an incredibly complex procedure.  What am I
missing?

- andy g.

Re: Searching with a score cutoff

Posted by Yonik Seeley <yo...@apache.org>.
On 6/4/07, Andy Goodell <ag...@discoverymining.com> wrote:
> Currently our application implements a score cutoff by iterating through the
> hits and then stopping once it reaches a hit whose score is below our
> threshold.  We'd like to optimize this (and avoid looking at the entire hits
> when we don't need to) by having the score cutoff applied when the hits are
> gathered.  The only way I can see of doing this is by over-riding
> Similarity, which seems like an incredibly complex procedure.  What am I
> missing?

Look at the search methods that accept a HitCollector.

-Yonik

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org