Rust library for approximate string matching
Trainable, modular AI engine in Rust with compile-time knowledge
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Levenshtein distance algorithm
Levenshtein distance algorithm
Levenshtein/Universal Automata for approximate string matching using various dictionary backends
Simple levenshtein spell checker app
AI/Human task management system with file-based storage
AXON — the formal cognitive language: a deterministic, proof-carrying AI runtime. Native Rust lexer/parser/type-checker/IR generator (re-exported from axon-frontend) plus the runtime: typed channels (π-calculus mobility, capability extrusion), algebraic effects via Free Monad CPS handlers, lease kernel + reconcile loop, the Epistemic Security Kernel, Trust Types, Proof-Carrying Code (independently verifiable proof objects), and the closed-catalog extension mechanism. Crate publishes as `axon-lang`; library import is `use axon::*` so existing call sites keep working unchanged.
Levenshtein algorithm
A copy of Levenshtein distance implementation from Rust Compiler
Fuzzy string distance comparisons