Walt Stoneburner wrote:
Does +(A1 A2 A3) +(B1 B2 B3) -(C1 C2 C3) find documents that have at least
one A -and- at least one B, but never any Cs? ...to which I'm now given to
understand the answer is yes. And understand why.
Well, that example would follow standard boolean logic if that's the
: here is that it's not that I'm finding different documents, but rather it's
: the same set and they will be ranked differently.
:
: Can you point me at a resource that explains the ranking and coord factors?
: I'm trying to understand scoring better. Going to the BooleanQuery
The best resource
Mike Klaas elaborates on syntax:
+(-A +B) -> must match (-A +B) -> must contain B and must not contain A
-(-A +B) -> must not match (-A +B) -> must not (match B and not contain A)
Ok, the take-away from this I'm getting is that these clauses read very much
like English and behave just the same.
On 4/10/07, Walt Stoneburner <[EMAIL PROTECTED]> wrote:
Furthermore syntax like +(-A +B) and -(-A +B) appear to be legal to Luke,
though I have no clue what this even means in simple English.
Let me try:
+(-A +B) -> must match (-A +B) -> must contain B and must not contain A
-(-A +B) -> must
: The problem is the grouping operator ( ) and how it works with distributed
: operators, I don't quite get what the specific transformation rules are.
you shouldnt' think if parens as a groiuping operator, you should think of
it as a way to force the explicit creation of a BooleanQuery object.
Steven Parkes points out:
Lucene doesn't use a pure Boolean algebra, so things don't always do
what one might expect and things like De Morgan's law don't hold.
You're exactly on to what I was pondering about. With boolean logic, I
understand the operators inside and out, so something like De
: My first impression is that it is exactly like specifying the terms ...
: however, the boolean expression in me it telling me that's NOT( RADISH OR
: SHOE) ... which, from the programming example I sited before means a
http://wiki.apache.org/lucene-java/BooleanQuerySyntax
When dealing with Luce
;t documented anywhere.
It's not in queryparsersyntax.html.
-Original Message-
From: Walt Stoneburner [mailto:[EMAIL PROTECTED]
Sent: Monday, April 09, 2007 5:38 PM
To: java-user@lucene.apache.org
Subject: Re: Standard Parser Behavior
Otis Gospodnetic <[EMAIL PROTECTED]> responded
On 4/9/07, Walt Stoneburner <[EMAIL PROTECTED]> wrote:
What happens when I write +HORSE -(RADISH SHOE)?
That is equivalent to +HORSE -RADISH -SHOE
Documents with either RADISH or SHOE will not be returned.
Your comments seem to indicate that you think otherwise... am I
misunderstanding?
-Yonik
Otis Gospodnetic <[EMAIL PROTECTED]> responded to Walt Stoneburner:
Purely negative queries don't work. Example: -A will not find all
documents that do not have "A".
What I'm trying to do is augment an existing query by appending qualifiers.
If I search for +HORSE -RADISH, I should get only d
Purely negative queries don't work. Example: -A will not find all documents
that do not have "A".
+ means a term or phrase is required
- means a term or phrase is prohibited
Otis
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Simpy -- http://www.simpy.com/ - Tag - Search - Sh
11 matches
Mail list logo
