Filters for Efficient Composition of Weighted Finite-State Transducers

DOI10.1007/978-3-642-18098-9_4zbMath1297.68102OpenAlexW2104599542MaRDI QIDQ3073618

Cyril Allauzen, Johan Schalkwyk, Michael D. Riley

Publication date: 11 February 2011

Published in: Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-18098-9_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Uses Software

• OpenFst

Cites Work

• Unnamed Item
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On the consecutive ones property
• PC trees and circular-ones arrangements.
• Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• General Algorithms for Testing the Ambiguity of Finite Automata

This page was built for publication: Filters for Efficient Composition of Weighted Finite-State Transducers