Repository navigation
MoonWFST 0.1.0
MoonWFST 0.1.0 provides a reusable weighted finite-state transducer model and a bounded set of graph algorithms in MoonBit.
- Validated snapshots, explicit epsilon labels/final weights, caller semirings and Boolean/bounded tropical weights.
- Projection/inversion, epsilon-free composition, weighted union/concatenation, support membership and graph trimming.
- Shortest accepting paths, DAG k-best and order-sensitive forward/backward/total aggregation.
- Three runnable synthetic workflows: speech/lexicon, morphology and OCR constraints.
Verified commit: a9f4181.
CI: https://github.com/okMambaOut/moon-wfst/actions/runs/38513866594 (all five jobs pass, including native check/build/test).
Local Moon 0.1.20261012: wasm-gc/wasm/js each 47 tests; four strict check targets; three examples. No local native runtime claim.
Composition requires epsilon-free graphs and compatible semirings with commutative multiplication. DAG algorithms reject cycles across the whole graph. No epsilon filters/closure, determinization, minimization, OpenFst binary compatibility or recognition models. See README and design contracts before integration.
License: Apache-2.0; independent implementation, OpenFst/RustFST semantic references only. Original contributor attribution is preserved in history.