[
https://issues.apache.org/jira/browse/LUCENE-7434?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15476173#comment-15476173
]
Mikhail Khludnev commented on LUCENE-7434:
------------------------------------------
The most intriguing question about {{TermAutomatonQuery}} is its' efficiency.
Can it load term positions only for those docs which passed term level
minShouldMatch condition? eg if someone can experiment, it would be great to
search with this query on a huge index and then compare it to to the same query
intersected with minShouldMatch disjunction with plain term queries. Will the
later speedups TAQ by faster dragging?
> 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, FSA for repeating
> words.PNG, TestMinShouldMatchSpan.java, TestMinShouldMatchSpan.java, a b c d
> e f mm=3.PNG, a b c d e f mm=3.PNG
>
>
> 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
