AllAlgorithms
diff --git a/‎algorithms/strings/levenstein.py
Copy file name to clipboard
+9 b/‎algorithms/strings/levenstein.py
Copy file name to clipboard
+9
@@ -0,0 +1,9 @@
+def distance_levenstein(a, b):
+    f = [[(i+j) if i*j == 0 else 0 for j in range(len(b)+1)] for i in range(len(a) + 1)]
+    for i in range(1, len(a) + 1):
+        for j in range(1, len(b) + 1):
+            if a[i-1] == b[j-1]:
+                f[i][j] = f[i-1][j-1]
+            else:
+                f[i][j] = 1 + min(f[i-1][j], f[i][j-1], f[i-1][j-1])
+    return f[len(a)][len(b)]