The following pages link to OpenFst (Q13407):
Displaying 14 items.
- From tree automata to string automata minimization (Q722214) (← links)
- Compositions of constant weighted extended tree transducers (Q832923) (← links)
- Extended multi bottom-up tree transducers (Q1038420) (← links)
- Minimizing deterministic weighted tree automata (Q1041045) (← links)
- Algorithms for probabilistic and stochastic subsequential failure transducers (Q2117672) (← links)
- Survey: finite-state technology in natural language processing (Q2357102) (← links)
- Implementation of Code Properties via Transducers (Q2830220) (← links)
- A Pushdown Transducer Extension for the OpenFst Library (Q2914694) (← links)
- Automata in SageMath---Combinatorics meet Theoretical Computer Science (Q2965981) (← links)
- Filters for Efficient Composition of Weighted Finite-State Transducers (Q3073618) (← links)
- A Type System for Weighted Automata and Rational Expressions (Q3192261) (← links)
- Pairwise Rational Kernels Obtained by Automaton Operations (Q3192278) (← links)
- (Q5061527) (← links)
- HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers (Q5188618) (← links)
