[
https://issues.apache.org/jira/browse/SOLR-3101?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13251888#comment-13251888
]
Jan Høydahl commented on SOLR-3101:
-----------------------------------
Cool. Of course a proper parser framework with a grammar would make it easier
to implement this correctly (LUCENE-1567), but with the current edismax we
could try to support the simple A NEAR/N B as a start?
> Add an operator to edismax for word order (Proximity / NEAR)
> ------------------------------------------------------------
>
> Key: SOLR-3101
> URL: https://issues.apache.org/jira/browse/SOLR-3101
> Project: Solr
> Issue Type: Sub-task
> Components: query parsers
> Reporter: Mike
> Fix For: 4.0
>
> Original Estimate: 4h
> Remaining Estimate: 4h
>
> A project I'm working on requires *word order* searching. The users are
> accustomed to Sphinx search, and expect a query like [ A << B ] to return
> only documents that contain the term A before the term B.
> I believe this can currently be done with the surround parser (SOLR-2703),
> but we lack an operator for it. It would be great to add it, so that word
> order searches can be combined by users into sophisticated queries.
> Note that this should also support a query like [ A << A], which would
> require that the term be in the document twice (the first instance before the
> second).
> This issue is part of a meta issue, SOLR-3028, that is requesting two other
> operators in edismax (quorum search and exact match).
--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators:
https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira
---------------------------------------------------------------------
To unsubscribe, e-mail: [email protected]
For additional commands, e-mail: [email protected]
