damerau-levenshtein
Edit distance calculator
Calculates edit distance between two strings using the Damerau-Levenshtein algorithm
Calculates edit distance using Damerau-Levenshtein algorithm
145 stars
7 watching
19 forks
Language: Ruby
last commit: almost 2 years agoLinked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| Fast string edit distance computation using the Damerau-Levenshtein algorithm | 150 | |
| An edit-distance algorithm implementation in C | 82 | |
| Calculates the difference between two strings using the Levenshtein distance algorithm | 7 | |
| A utility extension for computing string similarities between two sequences using the Levenshtein distance algorithm | 15 | |
| A Go implementation of the Levenshtein distance algorithm for string comparison | 364 | |
| Calculates Levenshtein distance and similarity metrics between two strings | 86 | |
| A fast implementation of Levenshtein distance for calculating string similarity | 664 | |
| A high-performance Levenshtein Distance calculator with SIMD and threading support. | 285 | |
| Provides fast string edit distance algorithms with C implementations using FFI bindings in Ruby. | 80 | |
| A comprehensive Go library for calculating string similarity and edit distances between strings | 488 | |
| Library for comparing sequences of characters with various distance metrics. | 117 | |
| A collection of edit distance algorithms and similarity measures for text sequences | 16 | |
| A Rust library providing optimized SIMD-based edit distance routines and string search algorithms with platform-dependent fallbacks. | 105 | |
| A Ruby library implementing algorithms for calculating the cost of changing one word into another | 61 | |
| A JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity. | 718 |