other
choice. As for performance, you approach is much faster than your
alternative :-) (i.e. doing it by hand.) Writing the stemmer seems
pretty easy, so I would go for it and then test it to see if it meets
your needs and, then, if you can, share it with others here.
-Grant
On Aug 4, 2006, at
in running the stemmer (keep the
lexicon in memory?), and performance issues (multiple lookups in the lexicon
could make it much slower than a rule based stemmer?). In general, any feedback
would be appreciated.
Thanks in advance,
Marios Skounakis
Msg sent v
Hi all,
Suppose the user enters the following query using a textbox interface:
"rate based optimization" (as a phrase query, including the quotes). The
query is parsed using QueryParser, then it is rewritten, and given to
the highlighter. Then, method getBestTextFragments is called.
The met
Hi all,
I recently came across the Compass Framework, which is built on top of lucene. I
am interested in it because it stores the lucene index in an RDBMS and provides
transaction support for index updates (it also has several other features but
this is the part I'm mostly interested in).
I w
es to the query impact
the query's performance? Are there any studies on search speed in
relation to the number of query clauses?
Is there another way to do handle this issue?
Many thanks in advance,
Marios Skounakis
-
To
ble workaround if you
don't want the added complexity of efforts like Compass.
What do you think?
Marios Skounakis
- Original Message -
From: "Beto Siless" <[EMAIL PROTECTED]>
To:
Sent: Thursday, November 17, 2005 11:18 PM
Subject: Re: Lucene & Transa
ystem like Lucene and I should just go ahead without having
transactional semantics?
Thanks in advance,
Marios Skounakis
