OpenFst: A General and Efficient Weighted Finite-State Transducer Library
From MaRDI portal
Publication:3503890
DOI10.1007/978-3-540-76336-9_3zbMath1139.68352OpenAlexW1582482241MaRDI QIDQ3503890
Johan Schalkwyk, Wojciech Skut, Michael D. Riley, Mehryar Mohri, Cyril Allauzen
Publication date: 10 June 2008
Published in: Implementation and Application of Automata (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76336-9_3
Related Items (17)
Compositions of constant weighted extended tree transducers ⋮ Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers ⋮ Algorithms for Probabilistic and Stochastic Subsequential Failure Transducers ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ Minimizing Deterministic Weighted Tree Automata ⋮ Limited Non-determinism Hierarchy of Counter Automata ⋮ Unnamed Item ⋮ HFST Tools for Morphology – An Efficient Open-Source Package for Construction of Morphological Analyzers ⋮ Filters for Efficient Composition of Weighted Finite-State Transducers ⋮ OpenFst ⋮ Weighted automata ⋮ Extended multi bottom-up tree transducers ⋮ Minimizing deterministic weighted tree automata ⋮ Algorithms for probabilistic and stochastic subsequential failure transducers ⋮ Survey: finite-state technology in natural language processing ⋮ A disambiguation algorithm for weighted automata
Uses Software
Cites Work
- Introducing VAUCANSON
- Minimization algorithms for sequential transducers
- The design principles of a weighted finite-state transducer library
- GENERIC ∊-REMOVAL AND INPUT ∊-NORMALIZATION ALGORITHMS FOR WEIGHTED TRANSDUCERS
- ON THE COMPUTATION OF THE RELATIVE ENTROPY OF PROBABILISTIC AUTOMATA
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: OpenFst: A General and Efficient Weighted Finite-State Transducer Library
