: The Id and Phone fields are stored. So I can just do a MatchAllQuery as
: you suggested. I have read about field selectors on this mailing list
: but have never used it. Does anyone know where I can find some sample
: code? Thank you.
there's a couple of reusable implementations in subver
On Mon, Mar 24, 2008 at 9:34 PM, Otis Gospodnetic
<[EMAIL PROTECTED]> wrote:
> Hi Yannis,
>
> I don't think there is anything of that sort in Lucene, but this shouldn't
> be hard to do with a process outside Lucene. Of course. optimizing an index
> increases its size temporarily, so your extern
I didn't see the answer to this question. This is Windows-specific. I'm not a
Windows user, so I never had this problem, but I believe we've had code to work
around this issue in Java Lucene for years now. It could be that Lucene.Net
doesn't have that. In any case, it would be best to check
Hm, if all you are after is removing stop words for all 3 languages, why not
create a single Analyzer that includes a StopFilter and give it a list of stop
words for all 3 languages?
Otis
--
Sematext -- http://sematext.com/ -- Lucene - Solr - Nutch
- Original Message
From: Vinicius C
Hi Yannis,
I don't think there is anything of that sort in Lucene, but this shouldn't be
hard to do with a process outside Lucene. Of course. optimizing an index
increases its size temporarily, so your external process would have to take
that into account and play it safe. You could also set
See the FunctionQuery and the org.apache.lucene.search.function
package. You can also implement your own query, as it's not clear to
me how exactly you want to calculate the score. Essentially, you have
your implementation of BooleanQuery, I think. Perhaps more details
would help.
-Gra
The Id and Phone fields are stored. So I can just do a MatchAllQuery as you
suggested. I have read about field selectors on this mailing list but have
never used it. Does anyone know where I can find some sample code? Thank you.
> Date: Sat, 22 Mar 2008 16:03:54 -0700
> From: [EMAIL PROTECTED
Hi Uwe,
Thanks a lot for the code. I'm digging into it now!
Cheers,
Cuong
On Mon, Mar 24, 2008 at 7:41 PM, Uwe Goetzke <[EMAIL PROTECTED]>
wrote:
> Hi Cuong ,
>
> I have written a TolerantPhraseScorer starting with the code from
> PhraseScorer but I think I have modified it to much to be gener
ail: [EMAIL PROTECTED]
__ NOD32 2968 (20080324) Information __
This message was checked by NOD32 antivirus system.
http://www.eset.com
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Just to bring closure here: this in fact looks like some sort of JVM
hotspot compiler issue, as best we can tell.
Running java with -Xbatch (forces up front compilation) prevents
(works around) the issue.
I've committed some additional assertions to the particular Lucene
code (merging o
Ivan can you describe more about your application?
The overall time for indexing has gotten much faster in 2.3, but this
is assuming things like retrieving a document from its original
source, filtering it, etc, are minimal. If you have an application
where most of the time is spent outsi
Hi Cuong ,
I have written a TolerantPhraseScorer starting with the code from PhraseScorer
but I think I have modified it to much to be generally useful. We use it with
bigramm clusters and therefore does not need the slop factor for scoring but
have a tolerance factor (depending on the length o
Hi Ivan,
No, we do not use StandardAnalyser or StandardTokenizer.
Most data is processed by
fTextTokenStream = result = new
org.apache.lucene.analysis.WhitespaceTokenizer(reader);
result = new ISOLatin2AccentFilter(result); // ISOLatin1AccentFilter
modified that รถ -> oe
13 matches
Mail list logo
