Searching across spaces
That sounds like just what I'm looking for. Do you know if this is covered in
Lucene in Action or where I can find more information about it.
Eric Isakson wrote:
>You might consider using overlapping bi-gram tokenization with stripped out
>whitespace and a
You might consider using overlapping bi-gram tokenization with stripped out
whitespace and a PhraseQuery.
So your tokenized content, "spongebob squarepants", would look like:
sp po on ng ge eb bo ob bs sq qu ua ar re ep pa an nt ts
and your tokens for your query, "sponge bob", would look like
ffer from the too many clauses exception if you
have lots of words beginning with, in your exmaple, "form". The approach above
would avoid this but will obviously have a much bigger index size.
Regards
Paul I.
Hi All,
Just wanted to throw out something I'm working on. It is working well for me,
but I wanted to see if anyone can suggest any other alternatives that might
perform better than what I'm doing now.
I have a field in my index that contains keywords (back of the book index
terms) and a UI fe
from your previous post about memory..."Every time you sort on a field, a
FieldCache array is constructed for that field."
would that happen in this case for the field this comparator is not using?
-Original Message-
From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] On Behalf Of Chris Ho
Am I understanding your problem correctly?
If you have two hits:
Hit A score = .7876546 rounded score = .79date 2006Feb01
Hit B score = .7907536 rounded score = .79date 2006Jan01
You would like to have the hits sorted as A, B but you are getting the hits in
the order B, A becaus
