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

Judging from comments, people seem to be pretty happy with Sift3.

http://sift.codeplex.com