-user@lucene.apache.org
Cc: [EMAIL PROTECTED]
Subject: Re: implementing our own Scorer (BM25)
Excuse me, I don't want to write a very long email.
This is the BM25 Scorer formule:
log((N-f+0.5)/(f+0.5)) * (k1 + 1) * c / (c+k1*( (1-b)+b*l/L))
where
N = total numb
Excuse me, I don't want to write a very long email.
This is the BM25 Scorer formule:
log((N-f+0.5)/(f+0.5)) · (k1 + 1) · c / (c+k1·( (1-b)+b·l/L))
where
N = total number of documents
f = inverse frecuency (number of documents which contain the
term)
Please provide more information about what you have done so far.
On Oct 19, 2006, at 9:10 AM, beatriz ramos wrote:
Hello,
I'm trying to implement my own scoring algorithm with Lucene but I
don't get
any results.
Lucene documentation explains how to implement new scoring,
modifying Query,
Hello,
I'm trying to implement my own scoring algorithm with Lucene but I don't get
any results.
Lucene documentation explains how to implement new scoring, modifying Query,
Weight and Scorer classes. I have tried this but doesn't work
Do you have any idea?
I need some example to understand the
