13 karma · joined August 22, 2019
For example if the input query is "ello" and there is a dict.txt with millions of entries, it should output the words that are closest to the query: "hell", "hello", "fellowship", "mellow" and their respective matching scores (e.g 0.8, 0.9, 0.3, 0.7 respectively). The scores are just random numbers in this case.
(edited for clarity)
There is SymSpell, agrep, fuzzywuzzy, closestmatch, fuzzysearch, fuzzyset, SimString, ukkonen and others in Github.
The problem is I don't have a clue which one to use for each case, which are the cases and what are the differences between the libraries.
A writeup illustrating several cases with a recommendation of a library and a practical example for each one would be very helpful.
Btw, if anyone has experience with this type of stuff I would be interested in talking to you (mail is in profile).
Is it anything like this (typeahead example)? https://rawgit.com/jeancroy/FuzzySearch/master/demo/autocomp...
What is the name for this kind of approximate string matching?