The idea is to efficiently get the desired result set (top N) at once without having to re-run different queries inside the application logic. Query relaxation avoids having several round trips and possibly could be offered with and without deduplication. Maybe this is a feature required for Solr rather than for Lucene.
Question: Even if lucene's score is not absolute does it somewhat determine an partial order among results of different queries? J.D. 2007/4/9, Otis Gospodnetic <[EMAIL PROTECTED]>:
Not that I know of. One typically puts that in application logic and re-runs or offers to run alternative queries. No de-duping there, unless you do it in your app. I think one problem with the described approach and Lucene would be that Lucene's scores are not "absolute". Otis . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Simpy -- http://www.simpy.com/ - Tag - Search - Share ----- Original Message ---- From: J. Delgado <[EMAIL PROTECTED]> To: java-dev@lucene.apache.org; solr-dev@lucene.apache.org Sent: Monday, April 9, 2007 3:46:40 AM Subject: Progressive Query Relaxation Has anyone within the Lucene or Solr community attempted to code a progressive query relaxation technique similar to the one described here for Oracle Text? http://www.oracle.com/technology/products/text/htdocs/prog_relax.html Thanks, -- J.D. --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED] --------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
--------------------------------------------------------------------- To unsubscribe, e-mail: [EMAIL PROTECTED] For additional commands, e-mail: [EMAIL PROTECTED]
