| gustf/js-levenshtein |
207 |
|
192,450 |
200 |
about 6 years ago |
8 |
January 10, 2019 |
1 |
mit |
JavaScript |
| The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings. |
| ka-weihe/fast-levenshtein |
51 |
|
0 |
0 |
over 5 years ago |
0 |
|
0 |
mit |
Go |
| Fastest levenshtein implementation in Go. |
| christianscott/levenshtein-distance-benchmarks |
19 |
|
0 |
0 |
almost 6 years ago |
0 |
|
5 |
|
JavaScript |
| Code for "Making rust as fast as go" |
| vmchale/edit-distance |
10 |
|
0 |
0 |
about 4 years ago |
0 |
|
1 |
bsd-3-clause |
ATS |
| Levenshtein edit distance, packaged for ATS |
| tanhauhau/levenary |
6 |
|
0 |
99 |
over 5 years ago |
5 |
January 28, 2020 |
0 |
mit |
JavaScript |
| Find the shortest Levenshtein distance in the array |
| skroutz/string_metric |
5 |
|
0 |
0 |
almost 11 years ago |
5 |
May 25, 2015 |
2 |
mit |
Ruby |
| A simple library with String Metric algorithms |
