Go implementation to calculate Levenshtein Distance.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common...
Swift μ-framework for efficient array diffs and datasource adapters.