levenshtein
String distance metric
Calculates Levenshtein distance and similarity metrics between two strings
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
86 stars
2 watching
6 forks
Language: Go
last commit: over 4 years ago
Linked from 2 awesome lists
awesome-gocommon-prefix-bonusedit-costslevenshteinlevenshtein-distancesimilarity-metricstring-distancestring-pairsstring-similaritywinkler
Related projects:
Repository | Description | Stars |
---|---|---|
| An edit-distance algorithm implementation in C | 82 |
| A Go implementation of the Levenshtein distance algorithm for string comparison | 364 |
| Calculates edit distance between two strings using the Damerau-Levenshtein algorithm | 145 |
| A high-performance Levenshtein Distance calculator with SIMD and threading support. | 285 |
| A JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity. | 718 |
| A fast implementation of Levenshtein distance for calculating string similarity | 664 |
| A utility extension for computing string similarities between two sequences using the Levenshtein distance algorithm | 15 |
| Fast string computation and similarity functions for text analysis | 1,265 |
| Calculates the difference between two strings using the Levenshtein distance algorithm | 7 |
| A comprehensive Go library for calculating string similarity and edit distances between strings | 488 |
| Fast string edit distance computation using the Damerau-Levenshtein algorithm | 150 |
| Facilities to calculate the distance and similarity between strings using various algorithms | 61 |
| Library for comparing sequences of characters with various distance metrics. | 117 |
| A .NET port of Java string similarity library implementing various distance and similarity measures | 452 |
| A Java library implementing various string similarity and distance measures. | 2,697 |