Return-Path: Delivered-To: apmail-jakarta-lucene-dev-archive@apache.org Received: (qmail 58537 invoked from network); 19 Feb 2002 17:09:33 -0000 Received: from unknown (HELO nagoya.betaversion.org) (192.18.49.131) by daedalus.apache.org with SMTP; 19 Feb 2002 17:09:33 -0000 Received: (qmail 15106 invoked by uid 97); 19 Feb 2002 17:09:27 -0000 Delivered-To: qmlist-jakarta-archive-lucene-dev@jakarta.apache.org Received: (qmail 14854 invoked by uid 97); 19 Feb 2002 17:09:22 -0000 Mailing-List: contact lucene-dev-help@jakarta.apache.org; run by ezmlm Precedence: bulk List-Unsubscribe: List-Subscribe: List-Help: List-Post: List-Id: "Lucene Developers List" Reply-To: "Lucene Developers List" Delivered-To: mailing list lucene-dev@jakarta.apache.org Received: (qmail 14724 invoked from network); 19 Feb 2002 17:09:21 -0000 X-MimeOLE: Produced By Microsoft Exchange V6.0.5762.3 content-class: urn:content-classes:message MIME-Version: 1.0 Content-Type: text/plain; charset="iso-8859-1" Content-Transfer-Encoding: quoted-printable Subject: RE: Lucene Query Structure Date: Tue, 19 Feb 2002 17:49:26 +0100 Message-ID: <50EA669584662B498F13A5F24630A0C01BAD2E@peach.mnet.private> X-MS-Has-Attach: X-MS-TNEF-Correlator: Thread-Topic: Lucene Query Structure Thread-Index: AcG5YbXRfKiKWVTJScyM8tfI32JJDAAAruQw From: =?iso-8859-1?Q?Hal=E1csy_P=E9ter?= To: "Lucene Developers List" , "Lucene Users List" X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N X-Spam-Rating: daedalus.apache.org 1.6.2 0/1000/N > -----Original Message----- > From: Doug Cutting [mailto:DCutting@grandcentral.com] > Sent: Tuesday, February 19, 2002 5:05 PM > To: 'Lucene Developers List'; Lucene Users List > Subject: RE: Lucene Query Structure >=20 >=20 >=20 > Good analogies for the semantics of BooleanQuery are most=20 > internet search > engines (except Google) which permit you to put '+' or '-' in=20 > front of a > word to require or prohibit it. (Google requires terms by=20 > default.) A term > with no plus or minus is not required for a match, but all of=20 > the documents > containing it are included. >=20 "Keyword searching refers to a search type in which you enter terms = representing the concepts you wish to retrieve. Boolean operators are = not used. Implied Boolean logic refers to a search in which symbols are used to = represent Boolean logical operators. In this type of search on the = Internet, the absence of a symbol is also significant, as the space = between keywords defaults to either OR logic or AND logic. Many = well-known search engines traditionally defaulted to OR logic, but as a = rule are moving away from the practice and defaulting to AND. " = http://library.albany.edu/internet/boolean.html The queryParser of Lucene implies OR logic if no operator found in the = query, doesn't it? I think the users (on our site) prefer keyword = searching and implied AND logic. Unfortunatly to decide whether a query = contains any operator or not, needs to read and parse the whole query = (not LL(k) language). How could I modify the queryParser to implement = default AND logic? peter -- To unsubscribe, e-mail: For additional commands, e-mail: