fuzzysearch
fuzzysearch copied to clipboard
lithammer
:pig: Tiny and fast fuzzy search in Go
Hi, [Damerau–LevenshteinDistance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance) is the minimum number of edit operations ( insertions, deletions ,substitutions and transposition) required to change one word to another.It has one more action(transposition) compared to LevenshteinDistance. I...
In `fzf`, for example, there's so called *"exact search mode"*, triggered by `'`, which searches the exact phrase provided. Would it be possible to have something like this in `fuzzysearch`?...
Hello everyone. I want to ask you why this library uses string type for targets, not a Stringer interface or other. I think devs more often have to search in...
`RankFind` still uses plain `Find` to determine initial results, then measures Levenshtein distance afterwards. Maybe we can have another `RankFindLevenshtein` that uses Levenshtein distance to determine results.
Can we get a implementation where `abc xyz` and `xyz abc` match
like `fzf`'s mark as green: why don't we make this? :)
Adds a separate variant set of functions that can optionally be used to consume `Stringer` instead of just `string` As it does not change the original function set, backwards compatibility...
First of all, what an **awesome** lib! Thanks for the work. But I do have this design doubt: Let's say I wanna compare strings two by two to a target...
