Hi,
I haven't followed the whole thread, so pardon me if I am off topic.
In terms of OutOfMemoryExceptions, why not attempt to alleviate this in your
code, rather than overly relying on garbage collection. On other words: set big
objects to null when you are finished with them, in particular
Hi all,
I have attempted to find a concise definition of how the Lucene score is
calculated, something that can be understood by most people.
The information I found is accurate, but not particularly concise.
http://hudson.zones.apache.org/hudson/job/Lucene-trunk/javadoc//org/apac
Hi,
I posed a similar question on 09 May 08.
The response was as below. I did not go down this route however, as a
wild carded 'exact' phrase is in a way contradictory.
Regards
Jon
Hi,
Here's a searchable mailing list archive:
http://www.gossamer-threads.com/lists/lucene/java-user/
As
Our approach is:
If the keyword is a single word, then append the star (e.g. replace -
replace*)
If the keyword is a phrase containing one of more spaces, then it is
treated as an exact phrase (e.g. replace this - 'replace this')
Regards
Jon
-Original Message-
From: mick l
Hi all,
First of all, well done to the implementers of Lucene. The performance
is incredible! We get search results within 20-40 ms on an index about
1.5GB.
I could not find a Lucene maillist search engine, something I am a bit
surprised about!
My question is how I can implement wild carded
