[
https://issues.apache.org/jira/browse/LUCENE-7434?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel
]
Mikhail Khludnev updated LUCENE-7434:
-------------------------------------
Attachment: TestMinShouldMatchSpan.java
attaching [^TestMinShouldMatchSpan.java] my attempt with
[TermAutomationQuery|http://blog.mikemccandless.com/2014/08/a-new-proximity-query-for-lucene-using.html].
This test matches 3 of "a b c d" words as a phrase eg. it matches docs
{quote}
c *a* *b* *d*
*a* *b* *d* a
{quote}
also, it builds nice graphs like
https://s16.postimg.io/l8nvh91qt/minshould_match_span.png
Opinions ?
> 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,
> TestMinShouldMatchSpan.java
>
>
> 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]
