A very fast JavaScript implementation of Levenshtein distance for the k <= 1 case. - View it on GitHub