Filters for efficient composition of weighted finite-state transducers

Authors:
Cyril Allauzen;Michael Riley;Johan Schalkwyk
Affiliations:
Google Research, New York, NY;Google Research, New York, NY;Google Research, New York, NY
Venue:
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Year:
2010

Citing 9
Cited 2

On the consecutive ones property

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing

Theoretical Computer Science
Semiring frameworks and algorithms for shortest-distance problems

Journal of Automata, Languages and Combinatorics
PC trees and circular-ones arrangements

Theoretical Computer Science - Computing and combinatorics
Statistical modeling for unit selection in speech synthesis

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
General Algorithms for Testing the Ambiguity of Finite Automata

DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences
OpenFst: a general and efficient weighted finite-state transducer library

CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
A specialized on-the-fly algorithm for lexicon and language model composition

IEEE Transactions on Audio, Speech, and Language Processing

Hierarchical phrase-based translation representations

EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
A pushdown transducer extension for the openfst library

CIAA'12 Proceedings of the 17th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes a weighted finite-state transducer composition algorithm that generalizes the concept of the composition filter and presents various filters that process epsilon transitions, look-ahead along paths, and push forward labels along epsilon paths. These filters, either individually or in combination, make it possible to compose some transducers much more efficiently in time and space than otherwise possible. We present examples of this drawn, in part, from demanding speechprocessing applications. The generalized composition algorithm and many of these filters have been included in OpenFst, an open-source weighted transducer library.