-user@lucene.apache.org
Subject: RE: Advanced NearSpanQuery
Hi Mike and Simon,
Thanks again for your help, but I've created my own solution by writing a
custom span query.
Now, I can perform searches where some of the terms that I supply in the query
can be missing from the result.
This way
t,int,int,int) to avoid invoking
.end() : */
return (start1 == start2) ? (spans1.End() < spans2.End()) : (start1
< start2);
}
public override System.String ToString()
{
return GetType().FullName + "(" + query.ToString() + ")@" +
(firstTime ? &qu
oint me in the right direction?
Jeroen
-Original Message-
From: Mike Sokolov [mailto:soko...@ifactory.com]
Sent: woensdag 13 juli 2011 15:23
To: java-user@lucene.apache.org
Cc: Jeroen Lauwers
Subject: Re: Advanced NearSpanQuery
Can you wrap a SpanNearQuery around an DisjunctionSumQuery with
t; -Original Message-
> From: Mike Sokolov [mailto:soko...@ifactory.com]
> Sent: woensdag 13 juli 2011 15:23
> To: java-user@lucene.apache.org
> Cc: Jeroen Lauwers
> Subject: Re: Advanced NearSpanQuery
>
> Can you wrap a SpanNearQuery around an DisjunctionSumQuery with
>
nt: woensdag 13 juli 2011 15:23
To: java-user@lucene.apache.org
Cc: Jeroen Lauwers
Subject: Re: Advanced NearSpanQuery
Can you wrap a SpanNearQuery around an DisjunctionSumQuery with
minNrShouldMatch=8?
-Mike
On 07/13/2011 08:53 AM, Jeroen Lauwers wrote:
> Hi,
>
> I was wondering if anyo
Can you wrap a SpanNearQuery around an DisjunctionSumQuery with
minNrShouldMatch=8?
-Mike
On 07/13/2011 08:53 AM, Jeroen Lauwers wrote:
Hi,
I was wondering if anyone could help me on this:
I want to search for:
1. a set of words (eg. 10)
2. only a couple of words may come in be
Hi,
I was wondering if anyone could help me on this:
I want to search for:
1. a set of words (eg. 10)
2. only a couple of words may come in between (eg. 3) in the result
document
3. of the supplied set of (10) words, at least 8 must be present (or in
other words: 2 of the s
