>From the name, I thought this was an adaptive precision scheme, where the engine automatically tries broader matching if there are no matches or just a few. We talked about doing that with Ultraseek, but it is pretty tricky. Deciding when to adjust it is harder than making it variable.
Instead, this is an old idea that search amateurs seem to like. Show all exact matches, then near matches, etc. This is the kind of thing people suggest when they don't understand that a ranking algorithm combines that evidence in a much more powerful way. I talked customers out of this once or twice each year at Ultraseek. This approach fails for: * common words * misspellings Since both of those happen a lot, this idea fails for a lot of queries. I presume that Oracle implemented this to shut up some big customer, since it isn't a useful feature unless it closes a sale. DisMax gives you something somewhat similar to this, by selecting the best matching field. That is much more powerful and gives much better results. wunder On 4/9/07 12:46 AM, "J. Delgado" <[EMAIL PROTECTED]> wrote: > 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.
