KarlTillstrom
-
- 478 total downloads
- last updated 5/10/2020
- Latest version: 1.0.0
A C# implementation of the Levenshtein string distance, using lazy evaluation of its diagonals. Time Complexity: O( |a| * dist(A,B) ) Supports thresholding to skip calculations when distance is greater than... More information