Up to 100x faster strings for C, C++, CUDA, Python, Rust, Swift, JS, & Go, leveraging NEON, AVX2, AVX-512, SVE, GPGPU, & SWAR to accelerate search, hashing, sorting, edit distances, sketches, and memory ops 🦖
Repository Index
47,133 repositories indexed
1–7 of 7 · Most stars
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Go implementation to calculate Levenshtein Distance.
Swift μ-framework for efficient array diffs and datasource adapters.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.