Hamming distances and bitwise hamming distances
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Similarity trait Rust crate: compare input values, such as two or more items, then return an output value, such as a mesure of similarity, or correlation, or overlap.
Vector quantization (scalar, product, binary) for memory-efficient vector search - part of the iQDB family.
A library that simplifies fuzzy string matching in rust
A library for encoding DNA into u64 to allow for constant time hamming distance calculations.
Vector quantization primitives (RaBitQ, ternary, bit packing) for ANN systems.
Rust bindings for Facebook's PDQ image hashing library
Embedding Locality IDentifier - encode embeddings into sortable string IDs for vector search without vector stores, plus fast string similarity algorithms
Rate-distortion theory: R(D) function calculation, distortion measures, Blahut-Arimoto algorithm, and Lloyd-Max quantizer design
Implementations of string similarity metrics. Includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, Jaro-Winkler, and Sørensen-Dice.
Implementations of string similarity metrics. Includes Hamming, Levenshtein, OSA, Damerau-Levenshtein, Jaro, Jaro-Winkler, and Sørensen-Dice.