[
https://issues.apache.org/jira/browse/LUCENE-7434?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15456429#comment-15456429
]
Saar Carmi commented on LUCENE-7434:
------------------------------------
Thanks [[email protected]] for creating this issue.
In order to merge threads, I want to clarify that my original question was
about limiting the search window as well as the number of matches.
The slop parameter sets the maximum distance allowed between each of the
subspans and I was looking to add another parameter for the maximum window in
which multiple the sub spans should appear together - between the beginning of
the first, to the beginning/end of the last one.
> 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
>
> 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: [email protected]
For additional commands, e-mail: [email protected]
