Rust re-implementation of OpenFST - library for constructing, combining, optimizing, and searching weighted finite-state transducers (FSTs). A Python binding is also available.

FST (Fast Succinct Trie) implementation in Rust

Spell checking library for ZHFST/BHFST spellers, with case handling and tokenization support. (Spell checking derived from hfst-ospell)

Search and enrich/decorate strings at grep speed

Represent large sets and maps compactly with finite state transducers.

A specialised trie for paths in the style of a Patricia or radix trie, with optional optimised FST output

Solve a Wordle puzzle based on a provided word list

An automaton that matches if the input contains a specific subsequence ignoring ASCII case to be used with fst.

HFST Optimized Lookup for Rust