Abstract
Pushdown automata are devices that can efficiently represent context-free languages, have natural weighted versions, and combine naturally with finite automata. We describe a pushdown transducer extension to OpenFst, a weighted finite-state transducer library. We present several weighted pushdown algorithms, some with clear finite-state analogues, describe their library usage and give some applications of these methods to recognition, parsing and translation. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Allauzen, C., & Riley, M. (2012). A pushdown transducer extension for the OpenFst library. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7381 LNCS, pp. 66–77). https://doi.org/10.1007/978-3-642-31606-7_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
