lucene-java-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Yonik Seeley" <>
Subject Re: Phrase query-like query that doesn't requre all the terms?
Date Fri, 14 Nov 2008 16:49:24 GMT
Solr's dismax parser can generate queries that do most of this... it's
a combination of term queries and sloppy phrase queries.

Simplest example:
+(DEF GHI) "DEF GHI"~10^5

The only thing that it doesn't work for is the terms out of order
(they will still be matched).  You could use span queries if you
really need that ordering, but sloppy phrase queries already penalize
the out-of-order since it's a bigger edit distance (but it won't be a
"severe" penalty).


On Fri, Nov 14, 2008 at 11:40 AM, Teruhiko Kurosaka <> wrote:
> PhraseQuery requires all the terms in the phrase
> exists in the field being searched.  I am looking
> for a more permissible version of PhraseQuery which
> is sensitive to the order of the terms but
> allows missing terms, which would lower the score
> but still matches.
> For example, query "DEF GHI" would match with
> with relatively high score, but it would also
> match with:
> "DEF"
> "GHI"
> etc. with lower scores.
> This would NOT match (or severely penalizes the score)
> with:
> "GHI DEF" (out of order)
> "ABC XYZ" (no terms)
> Is there any such Query class or other way to achieve
> the similar effect?
> ----
> T. "Kuro" Kurosaka, Basis Technology
> San Francisco, California, U.S.A.
> ---------------------------------------------------------------------
> To unsubscribe, e-mail:
> For additional commands, e-mail:

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message