Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Allow searches that are sorted by, rather than restricted by, a criterion #1804

alanfgh opened this Issue Mar 2, 2019 · 1 comment


None yet
3 participants
Copy link

alanfgh commented Mar 2, 2019

Currently, we can only specify that search results satisfy a criterion. We can't specify that we want results that may or may not satisfy that criterion but that are sorted so that the ones that do satisfy it occur at the top of the list. This means that I need to guess beforehand how many hits I'm likely to get. If I guess too low, I have to either page through lots of results that are not what I'm looking for, or follow it with a more restrictive search. If I guess too high, I have to follow it with a less restrictive search.

This commonly happens with exact match vs. stemmed match. Let's say I'm looking for a verb. First, I use the default match, which (for the languages I'm learning) is stemmed. However, since the stemmer is imperfect, the results include a lot of hits that include words that happen to start with that prefix but are not the verb I'm looking for. Then I need to do an exact-match search (starting with "=") against the infinitive.

Note that Sphinx supports sorting modes:

so maybe we could take advantage of that functionality.

I mentioned this subject on the Wall:

@jiru jiru added the enhancement label Mar 4, 2019


This comment has been minimized.

Copy link

ckjpn commented Mar 6, 2019

Not exactly the same, but somewhat related.


Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
You can’t perform that action at this time.