31 packages returned for Tags:"Levenshtein"

Package type
Sort by
Options
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 the threshold https://www.codeinthenorth.com