Re: Getting a Better Understanding of Lucene's Search Operators

To answer questions like "what really happens" in terms of a lucene query, I've been helped greatly by two things... query.toString(); and Luke. Of the two, luke (google lucene luke) is quickest. It will show you what lucene request is produced by various query strings etc. Sorry if you alread

Re: Getting a Better Understanding of Lucene's Search Operators

: I should assume, though, that parenthesis work as expected? So where I was : doing things like: : ( A OR B ) AND ( C OR D ), that means that +(A B) +(C D) is actually : happening? yes ... anywhere i used a simple example like "A" or "foo" could be repalced with a parenthetical expression whose

Re: Getting a Better Understanding of Lucene's Search Operators

On 1/10/07, Chris Hostetter <[EMAIL PROTECTED]> wrote: I'm guessing there is suppose to be some sort of table structure to the mail you send ... it doesn't work in plain text mail readers so i'm not sure whta ou were trying to say. My bad, I was using GMail, and it was trying to produce a ver

Re: Getting a Better Understanding of Lucene's Search Operators

: This is now my generalized understanding of the parser's operators. Am I : closer? I'm guessing there is suppose to be some sort of table structure to the mail you send ... it doesn't work in plain text mail readers so i'm not sure whta ou were trying to say. In a nut shell... 1) Lucene's Q

Re: Getting a Better Understanding of Lucene's Search Operators

So, if I understand you right, a simple query of NOT ORANGES gets me every document that does not contain the word oranges, while a separate query with -ORANGES added will force the score to zero for all documents in which oranges does not appear. One's a selector, the other is a filter. Not

Re: Getting a Better Understanding of Lucene's Search Operators

Based on responses from Steven Rowe <[EMAIL PROTECTED]> and Mark Miller < [EMAIL PROTECTED]>: Lucene uses a scoring system that behaves similarly to a boolean system. ... more information in the October 2006 thread "QueryParser is Badly Broken

Re: Getting a Better Understanding of Lucene's Search Operators

Walt Stoneburner wrote: > Do I have correct and complete understanding of the two operators? Not entirely complete :) - more information in the October 2006 thread "QueryParser is Badly Broken": -

Re: Getting a Better Understanding of Lucene's Search Operators

On 1/10/07, Mark Miller <[EMAIL PROTECTED]> wrote: The subtle part is that a scoring system is being used that operates in something of a boolean fashion, but that has subtle difference. Mark, -thank you-. This explains it beautifully. So, if I understand you right, a simple query of NOT OR

Re: Getting a Better Understanding of Lucene's Search Operators

Lucene uses a scoring system that behaves similarly to a boolean system. Each piece of the query contributes to the score for each document...if a document scores 0, it is not returned in the results. To search for documents that must contain "apples" and may contain "oranges" use the query:

Getting a Better Understanding of Lucene's Search Operators

Hello, I'm trying to get a better understanding of Lucene's search operators as described in the documentation at http://lucene.apache.org/java/docs/queryparsersyntax.html The documentation goes out of its way to identify two operators, require and prohibit, but doesn't fully explain them against