For some reason it seems that either Lucene or Snowball has a problem with
the color purple. According the snowball experts the problem is with lucene.
Can anyone shed any light? Thanks,
Steve
-- Forwarded message --
From: Stephen Cresswell <[EMAIL PROTECTED]>
Date: 2008/4/22
Subj
Hi,
I am creating a new indexWriter to optimize the directory.
I will try using FSDirectory later.
Otis Gospodnetic wrote:
>
> Hi,
>
> No need to close parse and it is good to use the same searcher.
> I don't understand why you have that IndexWriter there if you are
> searching...
>
> Also
Hi,
No need to close parse and it is good to use the same searcher.
I don't understand why you have that IndexWriter there if you are searching...
Also, you may not benefit from explicit loading of the index into RAM. Try
without it first.
Otis
--
Sematext -- http://sematext.com/ -- Lucene -
Hi,
Here is what I am using Lucene.
I build the index (from different data source) during midnight. I build a
FSDirectory. Then I load it into RAMDirectory for the best performance. When
I built it, I called IndexWriter.optimize() once.
Once the index is built, I will never update it.
I have
Well, all things are possible But I don't think there's a way to get
the field from each document at scoring time efficiently. It looks like
you're already lazy-loading the field, which was going to be my suggestion.
You could get it much faster if you *did* index it (UN_TOKENIZED?) and
went
Hi all,
I am looking for a way to include a stored (non-indexed) field in the
computation of scores for a query.
I have tried using a ValueSourceQuery with a ValueSource subclass that
simply retrieves the document and gets the field, like:
public float floatVal(int doc) {
reader.document(doc
See the IndexModifier class. This assumes that by dynamically modify you
mean
change existing documents.
If all you're doing is adding new documents, you can freely add new docs to
an
existing index. There's a parameter on IndexWriter that determines whether
your index is opened for appending or o
Is it possible to compute a theoretical maximum score for a given query if
constraints are placed on 'tf' and 'lengthNorm'? If so, scores could be
compared to a 'perfect score' (a feature request from our customers)
Here are some related threads on this:
In this thread:
http://www.nabble.com/New
Hi Esra,
On 05/07/2008 at 11:49 AM, Steven A Rowe wrote:
> At Chris Hostetter's suggestion, I am rewriting the patch
> attached to LUCENE-1279, including the following changes:
>
> - Merged the contents of the CollatingRangeQuery class into
> RangeQuery and RangeFilter
> - Switched the Locale par
Hi,
I am using Lucene 2.1.0 at the moment and I have huge data which is
being indexed.
I am re indexing my data on daily basis. Now I would like to index my
data dynamically at any point in time.
I cannot afford to re index whole data due to its huge size and time it
requires.
How can I upd
Hi,
Here's a searchable mailing list archive:
http://www.gossamer-threads.com/lists/lucene/java-user/
As regards the wildcard phrase queries, here's one way I think you could
do it, but it's a bit of extra work. If you're using QueryParser, you'd
have to override the "getFieldQuery" method t
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 ph
12 matches
Mail list logo