Sep 4, 2018 · 1 min read
Good article!
A couple notes on string distances —
Levenshtein is fast but I believe may have issues with multibyte encodings — not hard to get around, but something to be aware of.
Consider also the Metaphone algorithm (https://en.wikipedia.org/wiki/Metaphone) for contexts where your user may not know how to spell what they’re looking for!
