There _is_ a README file at the root of the unzipped Lucene In Action
code. It does require some basic Java and Ant know-how.
Erik
On Apr 17, 2006, at 2:21 AM, Shajahan wrote:
Hi,
thankyou for your replay.
i am very sorry for asking again, but i am new to this Lucene.
please te
This could be related to the analyzer you used during indexing. Be
aware that matches are *exact* including case.
Erik
On Apr 17, 2006, at 1:34 AM, Vishal Bathija wrote:
Hi,
I am not able to retrieve the number of hits for a particular phrase .
The code below retrieves the hits only
Thanks Erick & Paul,
I also found a great example of a custom filter in LIA (6.4 Using a custom
filter)
Here's my updated testcase if anybody is interested...
= QueryParserTest.java
...
public class QueryParserTest extends LuceneTestCase {
I currently use
writer = new IndexWriter("index", new StandardAnalyzer(),true);
Should I use any other analyzer. Yes I am aware that the matches are
case sensitive.
Regards
Vishal
On 4/17/06, Erik Hatcher <[EMAIL PROTECTED]> wrote:
> This could be related to the analyzer
Are the terms you're adding to PhraseQuery lowercased? If not, then
that is most likely the issue.
Erik
On Apr 17, 2006, at 9:39 AM, Vishal Bathija wrote:
I currently use
writer = new IndexWriter("index", new StandardAnalyzer(),true);
Should I use any other
Hi all,
I would like to insert elements in a PriorityQueue where the value returned
by the 'lessThan' method for the same both objects can change over the time.
Just to clarify my problem, I would like to insert PriorityQueue objects in
the main PriorityQueue, so the 'lessThan' method from the mai
Hi Erik,
Thanks, that seemed to have solved the problem. Can you please
elaborate on the kind of input PhraseQuery takes in. Am I supposed to
add only lowercased terms to PhraseQuery. Is it possible to search for
a phrase that is not case sensitive?
Regards
Vishal
On 4/17/06, Erik Hatcher <[EMAIL
PhraseQuery needs terms that match what got indexed, simple as that.
QueryParser does this for you by using the specified analyzer on the
"phrase text" within double quotes and creating a PhraseQuery out of
the tokens. When you're creating a PhraseQuery directly with the
API, you need to
Hello,
If I have a user search for "b-trunk" I would like them to be able to
find "b-trunk" (with hypen). I would also like someone searching for
"b trunk" to also find "b-trunk".
On the other side, if someone searches for 12412 I would like them to be
able to find 12412-235, 12412-12
Hello
I am using span queries to get hits (Documents) and occurrences
(positions) of search terms within these documents.
For some reason, there is a disagreement between the order the Documents
are returned in hits, and the Documents are referenced (via order
number, starting from 0) in the S
Hi everyone,
I'm currently designing a Lucene search system and i'm
considering the indexing side of things.
Just wondered what kind of architecture people have
adopted for indexing - are CHRON jobs sufficient for
high volume drip feed indexing or has anyone
implemented a more sophisticated solut
I'm pretty new with this, but with my index for a database, I'm using
a Quartz scheduler. Also at the end of the index update, I set my
singleton of IndexSearcher to null. That way the index searcher will
be using the latest information. That bit as well as setting it to
null and not clo
All-
We are looking for someone with search experience (we leverage Lucene)
to lead a small team of developers as described below. If you are
interested, send your resume to [EMAIL PROTECTED] Thanks.
Joe
Job Title: Technical Lead/Engineering Manager - Ariba Content
Summary:
Ariba Spen
17 apr 2006 kl. 18.59 skrev John Powers:
Hello,
If I have a user search for "b-trunk" I would like them to be able to
find "b-trunk" (with hypen). I would also like someone searching for
"b trunk" to also find "b-trunk".
If you don't care about spans, make a filter that rebuilds the token
Is there maximum length to a string that is analazyed and put into a field?
IE if the String is 1 billion characters and analyzed, tokenized, and the
last word in the string only appears once at the end, would searching for
that last word against that field end with a hit for that document?
--
Ana
Is there maximum length to a string that is analazyed and put into a field?
IE if the String is 1 billion characters and analyzed, tokenized, and the
last word in the string only appears once at the end, would searching for
that last word against that field end with a hit for that document?
No
17 matches
Mail list logo
