mple.
But alas, I cannot seem to get access to any TermPositions from my above
BooleanQuery.
I have looked into the contributed SpanExtractorClass but
ConstantScoreRangeQuery seems unsupported
and I am at a loos as to how to best use Spans here.
Any help appreciated,
C>T>
--
TH!NKMAP
java-user-unsubscr...@lucene.apache.org
> For additional commands, e-mail: java-user-h...@lucene.apache.org
>
>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
gt;
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
issing here?
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
e 63, D-28213 Bremen
> http://www.thetaphi.de
> eMail: u...@thetaphi.de
>
> > -Original Message-
> > From: Christopher Tignor [mailto:ctig...@thinkmap.com]
> > Sent: Friday, October 16, 2009 6:50 PM
> > To: java-user
> > Subject: IndexWriter optimize() deadloc
t possible to get the stack trace of the thrown exception when the
> thread was interrupted? Maybe indeed something in IW isn't cleaning
> up its state on being interrupted.
>
> Mike
>
> On Fri, Oct 16, 2009 at 1:43 PM, Christopher Tignor
> wrote:
> > thanks for getting bac
looks like a normal "optimize is waiting for the
> background merges to complete". Is it possible your background merges
> are hitting exceptions? You should see them on your error console if
> so...
>
> Mike
>
> On Fri, Oct 16, 2009 at 3:17 PM, Christopher
inal int size = mergeExceptions.size();
for(int i=0;iT>
On Fri, Oct 16, 2009 at 4:11 PM, Christopher Tignor wrote:
> After tracing through the lucene source more it seems that what is
> happening is after I call Future.cancel(true) on my parent thread,
> optimize() is called and this
e it, i.e. Future.cancel(false)
thanks,
C>T>
On Fri, Oct 16, 2009 at 4:44 PM, Christopher Tignor wrote:
> Indeed it looks like the thread running MergerThread started (After passing
> off to ConcurentMergeScheduler) by the thread calling IndexWriter.optimize()
> is indeed waiting o
ng this:
>
>http://issues.apache.org/jira/browse/LUCENE-1573
>
> (which is fixed in 2.9).
>
> Mike
>
> On Fri, Oct 16, 2009 at 6:01 PM, Christopher Tignor
> wrote:
> > I discovered the problem and fixed it's effect on my code:
> >
> > Using the sou
et info used for?
thanks so much,
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
cter offset info used for?
thanks so much,
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
ot;my*" and get a collection
of document ids that match this search,
is there a good way to determine whether this query found "myopic", "mylar"
or some other term without loading/searching the returned documents?
thanks!
C>T>
--
TH!NKMAP
Christopher Tignor | Senior
e sort of identifier that describes
the words as having to be at the same location - like a null slop or
something.
Any thoughts on how to do this?
thanks so much,
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
t. This will allow you to enumerate all terms that match
> your wildcard term.
> Is that what are you asking for?
>
> simon
>
> On Wed, Nov 18, 2009 at 10:39 PM, Christopher Tignor
> wrote:
> > Hello,
> >
> > Firstly, thanks for all the good answers and suppo
of synonyms. That is, index
> report and report_n (note no space) at the same location. Then, when
> you wanted to create a part-of-speech-aware query, you'd attach the
> various markers to your terms (_n, _v, _adj, _adv etc.) and not have to
> worry about unexpected side-effects.
ssing your intent is simply tacking on the part of speech
> marker to the words you care about (e.g. report_n when you wanted
> report as a noun). No phrases or slop required, at the expense of
> more terms.
>
> H, if you wanted to, say, "find all the nouns in the index", y
t inoto Spans first
which do not support searching for Terms at the same document position?
Any help appreciated.
thanks,
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
er
way.
C>T>
On Sat, Nov 21, 2009 at 10:47 PM, Adriano Crestani <
adrianocrest...@gmail.com> wrote:
> Hi,
>
> I didn't test, but you might want to try SpanNearQuery and set slop to
> zero.
> Give it a try and let me know if it worked.
>
> Regards,
p of -1, but one could try
> that for both the ordered and unordered cases.
> One way to do that is to start from the existing test cases.
>
> Regards,
> Paul Elschot
>
> >
> > Regards,
> > Adriano Crestani
> >
> > On Thu, Nov 19, 2009 at 7:28 PM, Chr
iling, returning no results.
C>T>
On Mon, Nov 23, 2009 at 11:59 AM, Mark Miller wrote:
> Your trying -1 with ordered right? Try it with non ordered.
>
> Christopher Tignor wrote:
> > A slop of -1 doesn't work either. I get no results returned.
> >
> > this wo
as a valid in-order result now that the eqaul to clause
has been added to the inequality.
C>T>
On Mon, Nov 23, 2009 at 12:26 PM, Christopher Tignor
wrote:
> Thanks so much for this.
>
> Using an un-ordered query, the -1 slop indeed returns the correct results,
> matching t
yes that indeed works for me.
thanks,
C>T>
On Mon, Nov 23, 2009 at 5:50 PM, Paul Elschot wrote:
> Op maandag 23 november 2009 20:07:58 schreef Christopher Tignor:
> > Also, I noticed that with the above edit to NearSpansOrdered I am getting
> > erroneous results fo no
sure why and am tracing through the code, looking at NearSpansUnordered.
Any thoughts?
thanks so much,
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
glance I'm not sure how to correlate the payload with
> the span match using NSU, nor why they're different.
>
> -
> To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
> For additional commands
tions.emptyList();
}
};
}
}
thanks,
C>T>
On Wed, Nov 25, 2009 at 8:10 AM, Grant Ingersoll wrote:
>
> On Nov 24, 2009, at 9:56 AM, Christophe
AM, Christopher Tignor wrote:
> yes that indeed works for me.
>
> thanks,
>
> C>T>
>
>
> On Mon, Nov 23, 2009 at 5:50 PM, Paul Elschot wrote:
>
>> Op maandag 23 november 2009 20:07:58 schreef Christopher Tignor:
>> > Also, I noticed that with the above ed
my own tests with my own data show you are correct and the 1-n slop works
for matching terms at the same ordinal position.
thanks!
C>T>
On Wed, Nov 25, 2009 at 4:25 PM, Paul Elschot wrote:
> Op woensdag 25 november 2009 21:20:33 schreef Christopher Tignor:
> > It's worth
ck Erickson wrote:
> Hmmm, are they unit tests? Or would you be wiling to create stand-alone
> unit tests demonstrating this and submit it as a patch?
>
> Best
> er...@alwaystrollingforworkfromothers.opportunistic.
>
> On Wed, Nov 25, 2009 at 5:38 PM, Christopher Tignor >wrote:
clude the shorter one and get weeded out.
thanks -
C>T>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
;
> Thanks,
> -Chris
>
>
> -
> To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
> For additional commands, e-mail: java-user-h...@lucene.apache.org
>
>
--
TH!NKMAP
Christopher Tignor | Senior Software Architect
155 Spring Street NY, NY 10012
p.212-285-8600 x385 f.212-285-8999
see that...
> >
> > Thanks,
> > -Chris
> >
> > -
> > To unsubscribe, e-mail: java-user-unsubscr...@lucene.apache.org
> > For additional commands, e-mail: java-user-h...@lucene.apache.org
> >
rd(int overlap, int maxOverlap) {
return 1f / (float) maxOverlap;
}
@Override
public float idf(int docFreq, int numDocs) {
return 1f;
}
@Override
public float sloppyFreq(int distance) {
return 0f;
}
}
--
TH!NKMAP
Christopher Tignor | Senior
This code is in fact working. I had an error in my test case. Things seem
to work as advertised.
sorry / thanks -
C>T>
On Fri, Apr 2, 2010 at 10:20 AM, Christopher Tignor wrote:
> Hello,
>
> I'm having a hard time implementing / understanding a very simple custom
> s
34 matches
Mail list logo
