I'm glad to see these built-in to Postgres, as these are the basics of fuzzy string matching. A quantum leap would be to integrate an implementation of the sym

I'm glad to see these built-in to Postgres, as these are the basics of fuzzy string matching. A quantum leap would be to integrate an implementation of the symmetric delete algorithm, such as https://github.com/wolfgarbe/SymSpell https://github.com/wolfgarbe/SymSpell Soundex and Phonex can yield too many false negatives outside of phonetically English names. Levenshtein/Jaro-Winkler aren't indexable solutions themselves, so they require N^2 comparisons. SymSpell conceptually combines these two into an indexed string-distance solution. It has the usual index issue of being designed for many reads, few writes.