ill fit your usage.
>
> ControlledRealTimeReopenThread is only necessary if you require
> certain searches to be real-time, e.g. you just indexed a document and
> then want to run a search that you know reflects that document.
>
> Mike McCandless
>
> http://blog.mikemccandless.com
>
>
> On Tu
Hi,
I was looking for some examples but I just found some using an NRTManager
class? In Lucene 4.5 I cannot find the class (missing a maven dependency?).
Can anyone point me to a working example?
Cheers,
Klaus
On Fri, Jan 3, 2014 at 11:49 AM, Ian Lea wrote:
> You will indeed get p
normal use case would be to read something from the index, maybe alter it
and then write back. So I would have roughly 50% of reads.
I tried also an embedded version of elastic search and it manages to go to
2000 documents/ per second. As its based on lucene as well I guess I do
something wrong in my
I've encountered the same problem and tried to use your workaround. But
overwriting the parser hasn't done the job.
I do not understand why the stemming is done anyway.
Uwe wrote
> This is a well-known problem: Wildcards cannot be analyzed by the query
> parser, because the analysis would destr
On 22/05/10 08:45, Julian Atkinson wrote:
Hi Klaus,
I suggest you take a look at the code in TestCartesian.java for
working examples of the search and as a staring point to trace
through.
in more depth, if you look at DistanceQueryBuilder.java you'll see 2
filters are being setup.
The
uery", but haven't seen any hints pointing in this direction and I
don't know whether I am able to implement that on my own. I fear that I
completely misunderstand something. Thanks in advance for any hints.
Regards,
Klaus
Hi Guys,
Is there a way to speed up couting documents that satisfy a search query other
than by using TopDocCollector.getTotalHits()?
For instance, if there are 100 documents satisfying my search query, how
can I count them without loading them all in memory?
Thanks,
Klaus.
--
Jetzt
happens in this situation? What index does
the reader end up having if it tries to open the index while the writer is
modifying it?
Any feedback will be much appreciated,
Klaus.
--
Jetzt kostenlos herunterladen: Internet Explorer 8 und Mozilla Firefox 3.5 -
sicherer, schneller und einfa
n over the scores of the subqueries. Since I do not consider
myself an expert in the internal working of Lucene, is there an easy way to
achieve this or do I have to reimplement the whole BooleanQuery class?
Thanks for any advice.
Rega
Hi
I'm using Lucene in a web application. Every time a new object is added to
the system the index will be updated. May there be any problems, if two
objects were created at the same moment? I know Lucene has some locking
mechanism.
Thx
klaus
-Ursprüngliche Nachricht-
Von:
>And next time if it is a refined search I will merge current query with
How do you recognize a refined query? And how are you the queries refined?
Cheers,
klaus
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additio
A simple approach is to count the most common words in the result set and
present them in combination with the original query. If you have any meta
information you could use them the refine the query.
-Ursprüngliche Nachricht-
Von: Chun Wei Ho [mailto:[EMAIL PROTECTED]
Gesendet: Montag, 1
Hi,
you have to index all object already contained in the database? Then there
is no other way then fetching all objects from the database and index them.
On Feb 8, 2006, at 1:18 AM, Raul Raja Martinez wrote:
> Hi Eric, I'm in the same situation, I wouldn't normally ask
> something related t
Hi,
you have to write your own similarity object and pass it to your analyzer.
http://lucene.apache.org/java/docs/api/org/apache/lucene/search/Similarity.h
tml
Cheers,
Klaus
-Ursprüngliche Nachricht-
Von: xing jiang [mailto:[EMAIL PROTECTED]
Gesendet: Sonntag, 5. Februar 2006 04:27
Hi Leon,
have you tried the WorldNet ad-on? You can easily expand the query with
synonyms.
-Ursprüngliche Nachricht-
Von: xing jiang [mailto:[EMAIL PROTECTED]
Gesendet: Dienstag, 31. Januar 2006 19:03
An: java-user@lucene.apache.org
Betreff: Re: Related searches
I think you should build
>In my case, i need to filter similar documents in search results and
>therefore determine document similarity during indexing process using
>term vectors. Obviously, i can't compare currently indexing document
>with all documents in my collection.
Yes you can. Right after indexing the new docum
annotation, or in an extra file. I will
start to implement this during the weekend. I think it will be hard to find
the right weights for the predicates, I will keep you informed.
Cheers,
Klaus
-
To unsubscribe, e-mail: [EMAIL P
Hi,
Is there a way to get the unstemmed term out of the lucene index, or do I
have to change the analyzer, to save the original term and the stemmed one?
Thank,
Klaus
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional
the know semantic I can weight them. Of course this
implies a knowledge of the domain ontology. For instance if there is a
predicate "cited_in_document" I could rank a document higher, if it is often
cited. But I'm not sure about the results...
Klaus
--
r the documents. You might argue that this would
adulterate the result, but from me point of view explicit Meta data should
be higher scored then terms in document body.
Cheers,
Klaus
-Ursprüngliche Nachricht-
Von: jason [mailto:[EMAIL PROTECTED]
Gesendet: Dienstag, 17. Januar 2006 15:
Hi,
I have tried to study to lucene scoring in the default similarity. Can
anyone explain me, how this similarity was designed? I have read a lot of IR
literature, but I have never seen an equation like the one used in lucene.
Why is this better then the normal cosine-measure?
Thanks,
Klaus
ermQuery with a value smaller
then one. I'm asking because I would like to boost each TermQuery with the
td*idf Value of the term in the original document. From my point of view,
this should lead to a better precision, but on the first looks the results
are
Thx, but where can I find this classes?
>If you really want to understand how scoring works, I'd suggest also
>looking at TermWeight/TermScorer.
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL
Hi all,
do you know how the tf und idf values are computed by the default
similarity? I mean the exact mathematical equation.
Thx,
Klaus
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL
Hi,
is there are build-in method for finding similar documents to one given
document?
Thx,
Klaus
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
Sent: Tuesday, January 03, 2006 5:26 PM
To: java-user@lucene.apache.org
Subject: Re: boosting results with a field from the
index
Hi Klaus,
You might want to just set the boost value of the
Document using your
importance number, then Lucene will factor that in
automatically when
scoring. Se
weighted automatically by lucene. I'm just wondering
if I can boost the results with the importance field I already have stored in
the index. As I result I expect the same search results just weighted
differently. Something like relevancy multiplied by importance.
Thank you so much,
Hi,
I think the easiest way is ro exclude the pages while you are parsing the
pdf document. So you will provide just the necessary pages to lucene.
Another solution is to create for each site an own document, this should
hafe a field "pagenumber" or, und you can delete the document from the
index
nks a lot
Klaus
can
update the Lucene index
in future and not go over this long building time
again. Your demo looks
really nice and its fast. Congratulations!
Bye,
Klaus
-Original Message-
From: Chris Lu [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 5:47 PM
To: java-user@lucene.apache.o
point on hte code and
then use Use the Debug
tab under Run.
this is a Lucene Form Guys
Karthik
-Original Message-
From: Klaus Hubert [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 5:54 PM
To: java-user@lucene.apache.org
Subject: RE: SIMPLE Lucene / MySQL Indexer
Hi
o the community if
somebody is interested.
Bye,
Klaus
-Original Message-
From: Xing Li [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 2:38 PM
To: java-user@lucene.apache.org
Subject: RE: SIMPLE Lucene / MySQL Indexer
Kalus,
Just a few days ago I couldn't even remember how
I
will try today all day
to get this fixed. I know, it shouldn't be too
difficult.
Thank you,
Klaus
-Original Message-
From: Xing Li [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 2:15 PM
To: java-user@lucene.apache.org
Subject: RE: SIMPLE Lucene / MySQL Indexer
Don
e in simple XML and go from
there. It is just an
additional step and I would stick with this if I don't
find another method
to do all at once.
Thanks,
Klaus
-Original Message-
From: Ian Lea [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 10:19 AM
To: java-user@lucene.ap
oblem
arises. But I cannot go step by step as I was used to
when Programming
Visual Basic, PHP or Perl.
Thanks,
Klaus
-Original Message-
From: Nader Henein [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 10:42 AM
To: java-user@lucene.apache.org
Subject: Re: SIMPLE Lucene /
second? (I
know, it depends on the hardware, but I'm just
wondering)
Thanks,
Klaus
-Original Message-
From: Chris Lu [mailto:[EMAIL PROTECTED]
Sent: Wednesday, July 13, 2005 5:04 AM
To: java-user@lucene.apache.org
Subject: Re: SIMPLE Lucene / MySQL Indexer
Please allow me to intr
(NetBeans IDE and JCreator) but
I don't get it managed to create an Lucene Index on 3
database fields.
I appreciate any help.
Thank you so much,
Klaus
__
Do You Yahoo!?
Tired of spam? Yahoo! Mail has the best spam protection around
http:/
-Ursprüngliche Nachricht-
Von: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED] Im Auftrag von Chris Hostetter
Gesendet: Montag, 6. Dezember 2004 21:32
An: Lucene Users List
Betreff: Re: indexReader close method
: Do you know why I can't close the IndexReader explicitly under some
: circums
38 matches
Mail list logo
