Andy,
Judging from your path, it looks like you didn't check things out of
SVN.
You'll need a SVN client, and then you could:
svn co http://svn.apache.org/repos/asf/lucene/java/trunk/
In there you will see a contrib/ directory, and highlighter underneath
it. Running ant from there builds the
What typically makes searches case insensitive are Analyzers that
lowercase/normalize tokens, perhaps with LowerCaseTokenizers. Since
Field.Keyword doesn't get analyzed, you'd have to manually
normalize/lowercase field values before indexing, or just add the raw +
the normalized value under the sa
Hi,
FYI:
The Lucence test fails with the following error:
compile-test:
[mkdir] Created dir: /opt/lucene/lucene/build/classes/test
[javac] Compiling 79 source files to /opt/lucene/lucene/build/classes/test
[javac]
/opt/lucene/lucene/src/test/org/apache/lucene/index/TermInfosTest.jav
Hi all,
I have a field that has been populated as a keyword e.g.
populated via doc.add(Field.Keyword("ID", "Xyz Abc"));
Is it possible to perform a case insensitive query that is if
I do a search for xyz, the document is returned.
I know tha
I've search the archives for this error, but it reported no matches...
I'm trying to get hold of the Highlighter code as this could be relevant
to my earlier post. I've checked out the highlight repo to my PC and
tried to build.
I get the following error:
$ ant
Buildfile: build.xml
init:
Hello;
This may be a trivial questions, but it has me stuck.
I'm getting some really small scores:
8.799379E-4
I need to figure out why they are so small.
I think it is problem which can be resolved using boosting.
I'm not sure how to boost given the system I have. The fields I query
against
The short answer is "no", there is not support for this currently.
Implementing this support is possible but fiddly- there is a related
discussion here which outlines some of the challenges :
http://www.mail-archive.com/lucene-user@jakarta.apache.org/msg12435.html
Cheers,
Mark
--
Hello, java-user.
I have two documents:
1. content:A V A B
2. content:A B C D
When I do search for content:"A B" (exact phrase search) and
StandardAnalyzer(),
when I use Highlighter I receive following highlighted results:
1. _A_ V _A B_
2. _A B_ C D
Actually "A" in the first result does not nee
This might be what you are looking for...
http://lucene.apache.org/java/docs/fileformats.html
-Original Message-
From: Nicolas Maisonneuve [mailto:[EMAIL PROTECTED]
Sent: Thursday, March 10, 2005 12:21 PM
To: Lucene Users List
Subject: what is the index compression technique in lucene ?
hy,
i would just know what is the index compression technique used in
lucene. where can i find some information about this ?
thanks in advance,
nicolas
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail
Hi folks,
I have a task when I need to read the query entered by the user, add to it many
other terms in a boolean expression and get the count of each clause in a
different field.
for examples: if the user enters: red. i need to take red and generate the
following query(red AND blue) OR (red A
I think I've found my problem. In the example I'm having the problem with I
do a multiple field query. I think I need to play with my boosting factors.
This is the section of the book that I think will lead to a resolution to my
problem:
In addition to the explicit factors in this equation, othe
A couple of times.
Luke
- Original Message -
From: "Erik Hatcher" <[EMAIL PROTECTED]>
To:
Sent: Wednesday, March 09, 2005 8:03 PM
Subject: Re: Score Question
> Did you reindex after upgrading?
>
> Erik
>
> On Mar 9, 2005, at 5:55 PM, Luke Shannon wrote:
>
> > Hi;
> >
> > Has the sc
Hy,
I'm trying to adapte a xml ranking model for lucene.
For the moment i'm just playing with the leaf node i.e. a node
containing data. For lucene, this node is a a search field and the idf
is replaced by ief (inversed element frequency)
ief= log (NumDoc_e)/(NumDoc_e_t+1) +1
NumDoc_e_t = numbe
I have a large index that needs to yield very fast query times. I am
sorting by date as default since I am interested in the most recent
documents. I was wondering if I boosted the score of my documents in
proportion to the date and not sorting would this increase search
performance. Thoughts?
What fields do you have and what are you putting in them?
On Thu, 2005-03-10 at 17:56 +0530, Karthik N S wrote:
> Hi Guys
>
> Apologies...
>
>
> I ditto as u said but the SpanNearQuery is
>
> returning me all the 3 documents containing for rollover of words
>
> 'DIGITAL CAMERAS'
Hi Guys
Apologies...
I ditto as u said but the SpanNearQuery is
returning me all the 3 documents containing for rollover of words
'DIGITAL CAMERAS' instead of returning me the 1st doc, Or none by changing
the slop factor
Any more ideas Please do .. B(
with regards
karthik
+1
Bernhard
Doug Cutting wrote:
Andrzej Bialecki wrote:
Hmmm... would not java.lang.Package various methods do the job?
I'm not sure... I just tried to do
Package.getPackage("org.apache.lucene") and got null, even though the
manifest is present in the JAR.
I looked into this. The packag
Thanks Erik,
I will investigate Filters and I'll see then.
On Wed, 9 Mar 2005 14:43:58 -0500, Erik Hatcher
<[EMAIL PROTECTED]> wrote:
>
> On Mar 9, 2005, at 10:09 AM, javier muguruza wrote:
> > (I sent this to the old list, I dont know wether it reached the
> > list...just in case I repost it)
On Thu, 2005-03-10 at 12:02 +0530, Karthik N S wrote:
> U got it bingo,Am trying to do something similar as u replied.
> But there is a glitch in the process
>
> If the search is done on the 'leaf_category' as u said
>
> with word such as 'CAMERA DIGITAL' instead of 'DIGITAL CAMERA' the
The highligher contrib package does what you're looking for:
http://svn.apache.org/repos/asf/lucene/java/trunk/contrib/highlighter/
By default it breaks the document into chunks roughly 100 characters
long. You can alter it to get tens words either side of the matched
term.
--
Miles Barr <[EM
21 matches
Mail list logo
