What is the returned order for documents with identical scores?
Peter
- Original Message -
From: "Chun, John" <[EMAIL PROTECTED]>
To: "Lucene Users List" <[EMAIL PROTECTED]>
Sent: Friday, January 16, 2004 3:44 PM
Subject: RE: Ordening documents
Results are returned by order of score (h
Results are returned by order of score (highest first), not by the order
they are inserted in the index.
You may find the faq useful,
http://lucene.sourceforge.net/cgi-bin/faq/faqmanager.cgi
in particular take a look at the 'searching section'.
hth,
-John
-Original Message-
From: Willia
William,
The order of the results are going to be based on how well they match the
query (i.e. weighted by relevancy). So although all of those values
contain the term "Palm", I would assume you would get the shorter entries
(i.e. 1 & 3) before the longer ones (2) as they have a higher percent
Hi Folks,
To the order of the result What really matters is ONLY the order in which
the information is stored in the index ?
Thanks,
William.
From: "William W" <[EMAIL PROTECTED]>
Reply-To: "Lucene Users List" <[EMAIL PROTECTED]>
To: [EMAIL PROTECTED]
Subject: Ordening documents
Date: Fri, 16
Hi folks,
I have some documents
doc 1 ==> name="Palm Zire"
doc 2 ==> name="Palm Zilion Zire"
doc 3 ==> name="Palm Test"
I will insert these docs in my index following the order doc 1, doc 2,
doc3.
If I execute the query ==> name:Palm
Witch order will the documents come ?
And
How long till there is a server version in PERL?
--
This message may contain confidential information, and is intended only for the use of
the individual(s) to whom it is addressed.
Karl Koch wrote:
Hello Andrzej,
sorry. I mistakenly run it under Java 1.2.2 which cannot work :-) Then you
get Threat Exceptions...
Anyway, solved now. Thank you,
Karl
Thanks for the report - it's my bad, too, because the JNLP file
mistakenly says . I'll correct it.
--
Best regards,
Andrzej Bial
what effect and what recommendations are valid for Lucene 1.3?
Herb
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
[EMAIL PROTECTED] wrote:
...
by mapping all the xml tags (name, street, postcode and city) it to the
documents (address) fields directly. However is it also possible to map these?
Here we have a hierarchy in area (niceplace) which I want to preserve.
Suppose that the meaning of n
Hello Andrzej,
sorry. I mistakenly run it under Java 1.2.2 which cannot work :-) Then you
get Threat Exceptions...
Anyway, solved now. Thank you,
Karl
> Karl Koch wrote:
>
> > Hello and thank you for this link. I think this is a very usefull tool
> to
> > analyse Lucene internals.
> >
> >
> >
No, you don't need required or prohibited, but you can't have both.
Here is a rundown:
* A required clause will allow a document to be selected if and only if
it contains that clause and will exclude any documents that don't.
* A prohibited clause will exclude any documents that contain that
To really preserve the relationships in arbitrarily
structured XML, you pretty much need to use a database
that directly supports an XML query language like
XQuery or XPath.
Mick .
-Original Message-
From: [EMAIL PROTECTED] [mailto:[E
Hi Karl, ol' fellow
try the apache commons digester.
there is a nice explanation about how it works written by thomas habing.
regards
thomas
[EMAIL PROTECTED] wrote:
Hello all,
it is obviously possible to index the follwoing XML structure in Lucene:
by mapping all the xml tags (n
Karl Koch wrote:
Hello and thank you for this link. I think this is a very usefull tool to
analyse Lucene internals.
I realize this is not exactly the answer, but you may want to try one of
the new features of Luke (http://www.getopt.org/luke), namely the query
result explanation.
When I star
Hello all,
it is obviously possible to index the follwoing XML structure in Lucene:
by mapping all the xml tags (name, street, postcode and city) it to the
documents (address) fields directly. However is it also possible to map these?
Here we have a hierarchy i
Karl Koch writes:
>
> If this is not the case, how is the term weight of the query calculated
> then? Formula? Are there parts in it which I cannot influence? Does this formular
> depend on the type of Query or is it independent. Maybe somebody can provide
> a small code example?
>
Scoring is ex
Hello and thank you for this link. I think this is a very usefull tool to
analyse Lucene internals.
> I realize this is not exactly the answer, but you may want to try one of
> the new features of Luke (http://www.getopt.org/luke), namely the query
> result explanation.
When I start it accordi
Karl Koch sagte:
> Hi all,
>
> why does the boolean query have a "required" and a "prohited" field
> (boolean
> value)? If something is required it cannot be forbidden and otherwise? How
> does this match with the Boolean model we know from theory?
What if required and prohibited are both off? Th
Hi all,
why does the boolean query have a "required" and a "prohited" field (boolean
value)? If something is required it cannot be forbidden and otherwise? How
does this match with the Boolean model we know from theory?
Are there differences between Lucene and the Boolean model in theory?
Kind R
Karl Koch wrote:
Hello all,
I am new to the Lucene scene and have a few questions regarding the term
boost physolophy:
Is the term boost equal to a term weight? Example: If I boost a term with
0.2 does this mean the term has a weight of 0.2 then?
If this is not the case, how is the term weight of
Hello all,
I am new to the Lucene scene and have a few questions regarding the term
boost physolophy:
Is the term boost equal to a term weight? Example: If I boost a term with
0.2 does this mean the term has a weight of 0.2 then?
If this is not the case, how is the term weight of the query calcu
21 matches
Mail list logo