You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I have a question: is it possible to utilize a function, such as levenshtein (https://www.postgresql.org/docs/9.1/fuzzystrmatch.html), to sort the outcomes of a search?
Here's the scenario: I conduct a search, and my preference is for the results to be organized based on their proximity (relevance) to the term within the variables.
reacted with thumbs up emoji reacted with thumbs down emoji reacted with laugh emoji reacted with hooray emoji reacted with confused emoji reacted with heart emoji reacted with rocket emoji reacted with eyes emoji
-
Hello community,
I have a question: is it possible to utilize a function, such as levenshtein (https://www.postgresql.org/docs/9.1/fuzzystrmatch.html), to sort the outcomes of a search?
Here's the scenario: I conduct a search, and my preference is for the results to be organized based on their proximity (relevance) to the term within the variables.
variable:
I would like the names closest to "wonder" to be displayed first and the names with the highest degree of variation in the search term towards the end
Looking insights and suggestions!
Beta Was this translation helpful? Give feedback.
All reactions