levenshtein-ffi
Edit distance calculator
Fast string edit distance computation using the Damerau-Levenshtein algorithm
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.
150 stars
3 watching
24 forks
Language: Ruby
last commit: over 1 year ago
Linked from 1 awesome list
Related projects:
| Repository | Description | Stars |
|---|---|---|
| | Calculates edit distance between two strings using the Damerau-Levenshtein algorithm | 145 |
| | An edit-distance algorithm implementation in C | 82 |
| | Provides fast string edit distance algorithms with C implementations using FFI bindings in Ruby. | 80 |
| | A high-performance Levenshtein Distance calculator with SIMD and threading support. | 285 |
| | A utility extension for computing string similarities between two sequences using the Levenshtein distance algorithm | 15 |
| | Calculates the difference between two strings using the Levenshtein distance algorithm | 7 |
| | A fast implementation of Levenshtein distance for calculating string similarity | 664 |
| | Calculates Levenshtein distance and similarity metrics between two strings | 86 |
| | A Go implementation of the Levenshtein distance algorithm for string comparison | 364 |
| | Fast string computation and similarity functions for text analysis | 1,265 |
| | A comprehensive Go library for calculating string similarity and edit distances between strings | 488 |
| | A Rust library providing optimized SIMD-based edit distance routines and string search algorithms with platform-dependent fallbacks. | 105 |
| | An optimized Levenshtein implementation for fast fuzzy matching and string comparison in .NET. | 250 |
| | Library for comparing sequences of characters with various distance metrics. | 117 |
| | An implementation of the Jaro-Winkler distance algorithm to compare strings | 195 |