triple_accel
Edit Distance Library
A Rust library providing optimized SIMD-based edit distance routines and string search algorithms with platform-dependent fallbacks.
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
105 stars
6 watching
13 forks
Language: Rust
last commit: almost 2 years ago
Linked from 1 awesome list
algorithmsavx2dynamic-programminghamminglevenshteinrustsimdssestring-distancestring-matchingstring-searchstring-similarity
Related projects:
Repository | Description | Stars |
---|---|---|
| A fast implementation of Levenshtein distance for calculating string similarity | 664 |
| Calculates edit distance between two strings using the Damerau-Levenshtein algorithm | 145 |
| Fast string edit distance computation using the Damerau-Levenshtein algorithm | 150 |
| A comprehensive Go library for calculating string similarity and edit distances between strings | 488 |
| An auxiliary serde library providing helpful functions for serialisation and deserialisation | 160 |
| A SIMD-based math library providing optimized kernels for various distance and similarity metrics | 1,141 |
| Provides fast string edit distance algorithms with C implementations using FFI bindings in Ruby. | 80 |
| An edit-distance algorithm implementation in C | 82 |
| A fast linear algebra library for games and graphics | 1,555 |
| Calculates Levenshtein distance and similarity metrics between two strings | 86 |
| A high-performance Levenshtein Distance calculator with SIMD and threading support. | 285 |
| A collection of edit distance algorithms and similarity measures for text sequences | 16 |
| A lightweight library for calculating sequence alignment using edit distance | 517 |
| A project providing a capability-based version of the Rust standard library for sandboxed and secure application development. | 664 |
| Facilities to calculate the distance and similarity between strings using various algorithms | 61 |