On Fri, Apr 17, 2009 at 3:37 AM, Chris Hostetter
<hossman_luc...@fucit.org>wrote:

>
>  this is a pretty hard problem in general ... in my mind i call it the
> "longest matching sub-phrase" problem, but i have no idea if it has a real
> name.
>
> the only solution i know of using Lucene is to construct a phrase query
> for each of the sub phrases, giving a bigger query boost to the "longer"
> phrases ... but it might be possible to design a customer query impl for
> solving this problem.
>

There was an issue opened for something similar but there is not patch yet.

https://issues.apache.org/jira/browse/SOLR-633

-- 
Regards,
Shalin Shekhar Mangar.

Reply via email to