hotwater
String distance library
Provides fast string edit distance algorithms with C implementations using FFI bindings in Ruby.
Fast Ruby FFI string edit distance algorithms
80 stars
5 watching
1 forks
Language: Ruby
last commit: over 13 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 edit distance between two strings using the Damerau-Levenshtein algorithm | 145 | |
| A Ruby library implementing algorithms for calculating the cost of changing one word into another | 61 | |
| A fast implementation of Levenshtein distance for calculating string similarity | 664 | |
| A comprehensive Go library for calculating string similarity and edit distances between strings | 488 | |
| A high-performance Levenshtein Distance calculator with SIMD and threading support. | 285 | |
| An implementation of the Jaro-Winkler distance algorithm to compare strings | 195 | |
| A Rust library providing optimized SIMD-based edit distance routines and string search algorithms with platform-dependent fallbacks. | 105 | |
| A collection of edit distance algorithms and similarity measures for text sequences | 16 | |
| Calculates distance between two geographic points using latitude and longitude coordinates | 2 | |
| A JavaScript implementation of the Levenshtein distance algorithm for measuring string similarity. | 718 | |
| A C++ library for fast string matching using the Levenshtein Distance algorithm | 250 | |
| Calculates distances between documents based on word embeddings | 461 | |
| A .NET port of Java string similarity library implementing various distance and similarity measures | 452 |