Paper Info
Title
A pushdown transducer extension for the openfst library
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.
Year
DOI
Venue
2012
10.1007/978-3-642-31606-7_6
CIAA
Keywords
Field
DocType
finite automaton,natural weighted version,openfst library,pushdown automaton,library usage,weighted pushdown algorithm,pushdown transducer extension,context-free language,clear finite-state analogue,weighted finite-state transducer library
Transducer,Embedded pushdown automaton,Context-free language,Programming language,Nested word,Computer science,Deterministic pushdown automaton,Theoretical computer science,Finite-state machine,Pushdown automaton,Parsing
Conference
Citations 
PageRank 
References 
4
0.53
10
Authors
2
Name
Order
Citations
PageRank
Cyril Allauzen169047.64
Michael Riley21027.13