damerau-levenshtein
Edit distance calculator
Calculates edit distance between two strings using the Damerau-Levenshtein algorithm
Calculates edit distance using Damerau-Levenshtein algorithm
144 stars
7 watching
19 forks
Language: Ruby
last commit: about 2 months ago
Linked from 1 awesome list
arbox/nlp-with-rubyRelated projects:
| Repository | Description | Stars |
|---|---|---|
 dbalatero/levenshtein-ffi | Fast string edit distance computation using the Damerau-Levenshtein algorithm | 149 |
 wooorm/levenshtein.c | An edit-distance algorithm implementation in C | 82 |
 nektro/zig-leven | Calculates the difference between two strings using the Levenshtein distance algorithm | 7 |
 mateusza/sqlite-levenshtein | A utility extension for computing string similarities between two sequences using the Levenshtein distance algorithm | 15 |
 agnivade/levenshtein | A Go implementation of the Levenshtein distance algorithm for string comparison | 359 |
 agext/levenshtein | Calculates Levenshtein distance and similarity metrics between two strings | 86 |
 roy-ht/editdistance | A fast implementation of Levenshtein distance for calculating string similarity | 661 |
 turnerj/quickenshtein | A high-performance Levenshtein Distance calculator with SIMD and threading support. | 284 |
 colinsurprenant/hotwater | Fast Ruby FFI bindings for efficient string edit distance algorithms | 81 |
 hbollon/go-edlib | A comprehensive Go library for calculating string similarity and edit distances between strings | 481 |
 doukremt/distance | Library for comparing sequences of characters with various distance metrics. | 117 |
 tcrouch/edits.cr | A collection of edit distance algorithms and similarity measures for text sequences | 16 |
 daniel-liu-c0deb0t/triple_accel | A Rust library providing optimized SIMD-based edit distance routines and string search algorithms with platform-dependent fallbacks. | 104 |
 schneems/going_the_distance | A Ruby library implementing algorithms for calculating the cost of changing one word into another | 61 |
 sindresorhus/leven | A JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity. | 715 |