The design principles of a weighted finite-state transducer library

DOI10.1016/S0304-3975(99)00014-6zbMath0951.68085OpenAlexW2087382212MaRDI QIDQ1575905

N. Delaunay

Publication date: 23 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00014-6

zbMATH Keywords

weighted finite-state transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70)

Related Items (15)

Weighted automata and weighted logics ⋮ Weighted automata and weighted logics with discounting ⋮ ON WEIGHTED BÜCHI AUTOMATA WITH ORDER-COMPLETE WEIGHTS ⋮ Weighted automata and weighted logics on infinite words ⋮ Weighted finite automata over strong bimonoids ⋮ Skew and infinitary formal power series ⋮ Weighted Automata and Weighted Logics ⋮ Finite-State Registered Automata for Non-Concatenative Morphology ⋮ OpenFst: A General and Efficient Weighted Finite-State Transducer Library ⋮ Weighted Automata and Weighted Logics with Discounting ⋮ Learning weighted automata over principal ideal domains ⋮ EDIT-DISTANCE OF WEIGHTED AUTOMATA: GENERAL DEFINITIONS AND ALGORITHMS ⋮ Uniformizing Rational Relations for Natural Language Applications Using Weighted Determinization ⋮ THE DESIGN PRINCIPLES AND ALGORITHMS OF A WEIGHTED GRAMMAR LIBRARY ⋮ Speech recognition by composition of weighted finite automata

Uses Software

• FSM

Cites Work

• Unnamed Item
• Unnamed Item
• Minimisation of acyclic deterministic automata in linear time
• Minimization algorithms for sequential transducers
• On the computational power of pushdown automata
• On the definition of a family of automata

This page was built for publication: The design principles of a weighted finite-state transducer library