Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

On 5/30/07, Daniel Einspanjer <[EMAIL PROTECTED]> wrote: What I quickly found I could do without though was the HTTP overhead. I implemented the EmbeddedSolr class found on the Solr wiki that let me interact with the Solr engine directly. This is important since I'm doing thousands of queries in

Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

On 4/11/07, Chris Hostetter <[EMAIL PROTECTED]> wrote: : Not really. The explain scores aren't normalized and I also couldn't : find a way to get the explain data as anything other than a whitespace : formatted text blob from Solr. Keep in mind that they need confidence the defualt way Solr du

Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

Yes, for good (hopefully) or bad. -Sean Shridhar Venkatraman wrote on 5/7/2007, 12:37 AM: Interesting.. Surrogates can also bring the searcher's subjectivity (opinion and context) into it by the learning process ? shridhar Sean Timm wrote: It may not be easy or even possible withou

Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

Interesting.. Surrogates can also bring the searcher's subjectivity (opinion and context) into it by the learning process ? shridhar Sean Timm wrote: It may not be easy or even possible without major changes, but having global collection statistics would allow scores to be compared across

Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

It may not be easy or even possible without major changes, but having global collection statistics would allow scores to be compared across searchers.  To do this, the master indexes would need to be able to communicate with each other. An other approach to merging across searchers is describe

Re: Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

On 4/11/07, Chris Hostetter <[EMAIL PROTECTED]> wrote: A custom Similaity class with simplified tf, idf, and queryNorm functions might also help you get scores from the Explain method that are more easily manageable since you'll have predictible query structures hard coded into your application

Ideas for a relevance score that could be considered stable across multiple searches with the same query structure?

I did a bit of research on the list for prior discussions of normalized scores and such. Please forgive me if I overlooked something relevant, but I didn't see anything exactly what I'm looking for. I am building a replacement for our current text matching engine that takes a list of documents f