lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Tim Allison (JIRA)" <j...@apache.org>
Subject [jira] [Comment Edited] (LUCENE-7434) Add minNumberShouldMatch parameter to SpanNearQuery
Date Fri, 02 Sep 2016 12:48:21 GMT

    [ https://issues.apache.org/jira/browse/LUCENE-7434?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15458383#comment-15458383
] 

Tim Allison edited comment on LUCENE-7434 at 9/2/16 12:48 PM:
--------------------------------------------------------------

Thank you for the clarification.

>From [~saar32] on the user list:

bq. Anyway, looking at the issue created I am not sure the description exactly matches what
I had in mind "Add minNumberShouldMatch parameter to SpanNearQuery"

bq. My understanding is that  SpanNearQuery will allow the maximum slop between each of the
elements. So we have 10 SpanTermQuery with a slope of 3, it could be that the distance between
the first and the last occurrence is 30.

Y, you're right, that would make a difference.

This was the example I had before I read your email. 

"a b c" with {{minNumberShouldMatch=2}} and {{slop=2}} should match this

x a x b x c x

but it wouldn't match

x a x x x c x

Whereas with a {{maxSearchWindow=5}}, there would be a hit on both.


was (Author: tallison@mitre.org):
Thank you for the clarification.

I think I got the {{minNumberShouldMatch}}, but let me know if I didn't.

Is there a substantive difference between {{maxSearchWindow}} and SpanNear's {{slop}}?

I can see a small difference in that:

"a b c" with {{minNumberShouldMatch=2}} and {{slop=2}} should match this

x a x b x c x

but it wouldn't match

x a x x x c x

Whereas with a {{maxSearchWindow=5}}, there would be a hit on both.

> Add minNumberShouldMatch parameter to SpanNearQuery
> ---------------------------------------------------
>
>                 Key: LUCENE-7434
>                 URL: https://issues.apache.org/jira/browse/LUCENE-7434
>             Project: Lucene - Core
>          Issue Type: Improvement
>          Components: core/search
>            Reporter: Tim Allison
>            Priority: Minor
>         Attachments: AllPairsNearSpans20160902.patch
>
>
> On the user list, [~saar32] asked about a new type of SpanQuery that would allow for
something like BooleanQuery's minimumNumberShouldMatch
> bq. Given a set of search terms (t1, t2, t3, ti), return all documents where in a sequence
of x=10 tokens at least c=3 of the search terms appear within the sequence.
> I _think_ we can modify SpanNearQuery fairly easily to accommodate this.  I'll submit
a PR in the next few days.



--
This message was sent by Atlassian JIRA
(v6.3.4#6332)

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


Mime
View raw message