Rust crate exposing Levenshtein automata as WFSTs for composition pipelines
The project wraps liblevenshtein's Levenshtein automata into the lling-llang WFST interface, letting users treat fuzzy matchers as composable weighted transducers. By exposing the automaton as a Wfst, it can be intersected with phonetic rewrites, language models, or custom transducers and then searched for optimal paths. This is useful for developers building advanced spell‑checking, autocomplete, or linguistic pipelines that need seamless integration of edit‑distance matching with other weighted models. It fills a niche gap, avoiding dependency cycles and providing a clean, reusable Rust library.
View on GitHub →vinary-tree/duallity