[
https://issues.apache.org/jira/browse/LUCENE-7434?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15458939#comment-15458939
]
Paul Elschot commented on LUCENE-7434:
--------------------------------------
bq. What's the use case for minNumberShouldMatch=2, all pairs?
This might generalize to higher values of minNumberShouldMatch, and replacing
the slop by a window is easy.
For higher values of minNumberShouldMatch it would probably be good to reuse
the implementation from boolean queries.
> 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-unsubscr...@lucene.apache.org
For additional commands, e-mail: dev-h...@lucene.apache.org
