lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Em <mailformailingli...@yahoo.de>
Subject Re: How is Number of Boolean Clauses calculated - Minimum Should Match?
Date Wed, 05 Oct 2011 11:03:24 GMT
Hi Ian,

thanks for the fast feedback.
>> If the MM was set to 4 (too many), than this means all queries have to
>> match?
>
> Presumably this query would fail, since you've only got three clauses.
>  Easy to verify.

Seems like different behaviour compared to Solr. Probably Solr is
intelligent enough to reduce the parameter to the maximum value if it is
too large.

I'll wait a little bit, before reposting my question on the Solr list.

Regards,
Em

Am 05.10.2011 12:51, schrieb Ian Lea:
> Sorry - you did say StopFilter or SynonymFilter but I started talking
> about oal.search.Filter instead.
> 
>> So if an Analyzer contains a StopFilter and the parser uses this
>> Analyzer, than the following will happen:
>>
>> Original:
>> "To be or not to be said Shakespeare"
>>
>> Stopwords: To, be, or
>>
>> Resulting BooleanClauses:
>> - not
>> - said
>> - Shakespeare
>>
>> Is this right?
> 
> Yes.
> 
>> If the MM was set to 4 (too many), than this means all queries have to
>> match?
> 
> Presumably this query would fail, since you've only got three clauses.
>  Easy to verify.
> 
>> If so, what is the problem in Solr with Stopwords and the Dismax-Parser?
> 
> That sounds like a different question, maybe one for the solr list.
> 
> 
> --
> Ian.
> 
> ---------------------------------------------------------------------
> To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
> For additional commands, e-mail: java-user-help@lucene.apache.org
> 
> 

---------------------------------------------------------------------
To unsubscribe, e-mail: java-user-unsubscribe@lucene.apache.org
For additional commands, e-mail: java-user-help@lucene.apache.org


Mime
View raw message