in the book as well.
>
> -- Jack Krupansky
>
> -Original Message- From: Jack Krupansky
> Sent: Tuesday, May 21, 2013 11:37 AM
>
> To: solr-user@lucene.apache.org
> Subject: Re: Expanding sets of words
>
> Hmmm... I did a quick test and quoted phrase wasn'
7;ll make sure that example is in the book as well.
-- Jack Krupansky
-Original Message-
From: Jack Krupansky
Sent: Tuesday, May 21, 2013 11:37 AM
To: solr-user@lucene.apache.org
Subject: Re: Expanding sets of words
Hmmm... I did a quick test and quoted phrase wasn't working for me e
t: Re: Expanding sets of words
I'll buy that book :)
Does this work with mutli-word terms?
(common lisp or assembly language)
(programming or coding or development)
I tried:
{!surround}(common lisp OR assembly language) W (programming)
but that returns a parse error.
Putting quotes around
Original Message- From: Mike Hugo
> Sent: Tuesday, May 21, 2013 12:29 AM
> To: solr-user@lucene.apache.org
> Subject: Re: Expanding sets of words
>
>
> Fantastic! Thanks!
>
>
> On Mon, May 20, 2013 at 11:21 PM, Jack Krupansky
> **wrote:
>
> Yes, with the Solr
I'll make sure to include that specific example in the new Solr book.
-- Jack Krupansky
-Original Message-
From: Mike Hugo
Sent: Tuesday, May 21, 2013 12:29 AM
To: solr-user@lucene.apache.org
Subject: Re: Expanding sets of words
Fantastic! Thanks!
On Mon, May 20, 2013 at 11:
nd&**indent=true"
>
> The LucidWorks Search query parser also supports NEAR, BEFORE, and AFTER
> operators, in conjunction with OR and "-" to generate span queries:
>
> q=(java OR groovy OR scala) BEFORE:0 (programming OR coding OR development)
>
>
development)
-- Jack Krupansky
-Original Message-----
From: Mike Hugo
Sent: Monday, May 20, 2013 11:42 PM
To: solr-user@lucene.apache.org
Subject: Expanding sets of words
Is there a way to query for combinations of two sets of words? For
example, if I had
(java or groovy or scala)
(pro
On 21 May 2013 09:12, Mike Hugo wrote:
> Is there a way to query for combinations of two sets of words? For
> example, if I had
>
> (java or groovy or scala)
> (programming or coding or development)
>
> Is there a query parser that, at query time, would expand that into
> combinations like
>
> ja
Is there a way to query for combinations of two sets of words? For
example, if I had
(java or groovy or scala)
(programming or coding or development)
Is there a query parser that, at query time, would expand that into
combinations like
java programming
groovy programming
scala programming
java
