An Optimal Wagner-Fischer Algorithm For Approximate Strings Matching In Python And NumPy

Compute the Levenshtein distance of literal strings effectively by using the Wagner-Fischer (two matrix rows-based) algorithm.

Click here to read the article