quickwit-oss / levenshtein-automataLinks
☆66Updated 2 years ago
Alternatives and similar repositories for levenshtein-automata
Users that are interested in levenshtein-automata are comparing it to the libraries listed below
Sorting:
- Spelling correction & Fuzzy search based on Symmetric Delete spelling correction algorithm.☆136Updated last week
- finalfusion embeddings in Rust☆102Updated last year
- Context-sensitive word embeddings with subwords. In Rust.☆87Updated last year
- Hidden Markov Models in Rust☆76Updated last year
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆139Updated last year
- Fast hierarchical agglomerative clustering in Rust.☆97Updated 2 months ago
- A suite of non-cryptographic hash functions for Rust.☆139Updated 3 years ago
- Probability-theory toolbox☆57Updated last year
- Simple probabilistic data structures☆146Updated last week
- A rust implementation of some popular snowball stemming algorithms☆127Updated last year
- String Distances in rust☆14Updated 2 years ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆166Updated 2 months ago
- Data parallelism library for async-std.☆93Updated last year
- Parallel iterator processing library for Rust☆103Updated last year
- Rust FFI wrapper for CRoaring☆158Updated 2 weeks ago
- Advisory cross-platform file locks using file descriptors☆78Updated 2 months ago
- Small and fast library for k-means clustering.☆49Updated last month
- A big integer library in Rust with good performance.☆105Updated last year
- ☆76Updated 2 years ago
- A Rust data structure for efficient lower-bound lookups☆90Updated last year
- An idiomatic and fast QP-trie implementation in pure Rust.☆101Updated last year
- Rust implementation of Duckling☆78Updated 3 years ago
- Rust port of Google's SwissTable hash map☆56Updated last month
- External sorting (i.e. on disk sorting) capability on arbitrarily sized iterator☆24Updated 2 months ago
- Extract differences between arbitrary datastructures☆89Updated last year
- A futures abstraction that runs a set of futures which may complete in any order.☆90Updated 2 months ago
- Basic statistical functions on streams for Rust.☆86Updated 2 years ago
- Lightweight FST-based autocompleter library written in Rust, targeting WebAssembly and data stored in-memory☆32Updated 2 years ago
- A simple in-memory search for collections and key-value stores.☆73Updated last month