lucene-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Mike (Commented) (JIRA)" <>
Subject [jira] [Commented] (SOLR-3028) Support for additional query operators (feature parity request)
Date Fri, 03 Feb 2012 20:25:54 GMT


Mike commented on SOLR-3028:

Thanks for the response. I really do appreciate it.

#1) It's possible to implement a custom query parser to add my own operator that directs the
user's query to separate fields (one stemmed, one not), but it would be better if built in
for two reasons. One, I'm sure I'd do it incorrectly or inefficiently. Two, having two fields
seems like a rather inefficient way of implementing exact match -- intuitively at least, having
two nearly identical indexes seems very bad. 

I'm also not sure SOLR-2866 is a good place for that discussion, since that issue is to implement
non-stemmed search by using humongous synonym files. Is it worth opening a new issue for the
index side of this feature?

#2) Sorry - I messed up in my description. I'm looking for *quorum search*, but I described
*proximity search*. Quorum search is more like "of these five words, find documents that contain
at least two of them." I suppose it's possible to do this with the mm parameter, but there's
no operator available to users, right?

#3) Woah, that's awesome! But, I don't think I can ask users to place queries with squiggley
brackets. Some kind of sane operator seems necessary to me.
> Support for additional query operators (feature parity request)
> ---------------------------------------------------------------
>                 Key: SOLR-3028
>                 URL:
>             Project: Solr
>          Issue Type: Improvement
>          Components: search
>    Affects Versions: 4.0
>            Reporter: Mike
>              Labels: operator, queryparser
>   Original Estimate: 6h
>  Remaining Estimate: 6h
> I'm migrating my system from Sphinx Search, and there are a couple of operators that
are not available to Solr, which are available in Sphinx. 
> I would love to see the following added to the Dismax parser:
> 1. Exact match. This might be tricky to get right, since it requires work on the index
side as well[1], but in Sphinx, you can do a query such as [ =running walking ], and running
will have stemming off, while walking will have it on. 
> 2. Term quorum. In Sphinx and some commercial search engines (like Recommind, Westlaw
and Lexis), you can do a search such as [ (cat dog goat)/15 ], and find the three words within
15 terms of each other. I think this is possible in the backend via the span query, but there's
no front end option for it, so it's quite hard to reveal to users.
> 3. Word order. Being able to say, "this term before that one, and this other term before
the next" is something else in Sphinx that span queries support, but is missing in the query
parser. Would be great to get this in too.
> These seem like the three biggest missing operators in Solr to me. I would love to help
move these forward if there is any way I can help.
> [1] At least, *I* think it does. There's some discussion of one way of doing exact match
like support in SOLR-2866.

This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:!default.jspa
For more information on JIRA, see:


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

View raw message