Repository Index

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 🦖

• simd
• dataset
• string
• string-manipulation

📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

• distance
• algorithm
• python
• textdistance

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...

• java
• levenshtein-distance
• cosine-similarity
• string-distance

📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

• go
• golang
• edit-distance
• algorithms

Go implementation to calculate Levenshtein Distance.

• levenshtein
• levenshtein-distance
• golang

Swift μ-framework for efficient array diffs and datasource adapters.

• edit-distance
• levenshtein-distance
• tableview
• datasource

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

• levenshtein
• levenshtein-distance
• similarity-metric
• common-prefix-bonus