distance
Sequence comparator
Library for comparing sequences of characters with various distance metrics.
Levenshtein and Hamming distance computation
117 stars
5 watching
17 forks
Language: C
last commit: about 5 years ago
Linked from 1 awesome list
Related projects:
Repository | Description | Stars |
---|---|---|
wooorm/levenshtein.c | An edit-distance algorithm implementation in C | 82 |
globalnamesarchitecture/damerau-levenshtein | Calculates edit distance between two strings using the Damerau-Levenshtein algorithm | 144 |
roy-ht/editdistance | A fast implementation of Levenshtein distance for calculating string similarity | 661 |
hbollon/go-edlib | A comprehensive Go library for calculating string similarity and edit distances between strings | 481 |
nektro/zig-leven | Calculates the difference between two strings using the Levenshtein distance algorithm | 7 |
ztane/python-levenshtein | Fast string computation and similarity functions for text analysis | 1,263 |
mateusza/sqlite-levenshtein | A utility extension for computing string similarities between two sequences using the Levenshtein distance algorithm | 15 |
agext/levenshtein | Calculates Levenshtein distance and similarity metrics between two strings | 86 |
agnivade/levenshtein | A Go implementation of the Levenshtein distance algorithm for string comparison | 359 |
turnerj/quickenshtein | A high-performance Levenshtein Distance calculator with SIMD and threading support. | 284 |
tcrouch/edits.cr | A collection of edit distance algorithms and similarity measures for text sequences | 16 |
sindresorhus/leven | A JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity. | 715 |
dbalatero/levenshtein-ffi | Fast string edit distance computation using the Damerau-Levenshtein algorithm | 149 |
schneems/going_the_distance | A Ruby library implementing algorithms for calculating the cost of changing one word into another | 61 |
mkusner/wmd | Calculates a measure of document similarity based on word embeddings | 538 |