Is there a faster (less precise) algorithm than Levenshtein for string distance?

Question

I want to run the Levenshtein, but WAY faster because it\'s real time application that I\'m building. It can terminate once the distance is greater than 10.

Answer 1

If you want to compare UTF-8 contents use sift4:

https://siderite.dev/blog/super-fast-and-accurate-string-distance.html

Also I prepared a jsPerf which shows the performance difference between those libraries: http://jsperf.com/levenshtein-perf