Semirings, automata, languages
Semirings, automata, languages
An efficient probabilistic context-free parsing algorithm that computes prefix probabilities
Computational Linguistics
The theory of parsing, translation, and compiling
The theory of parsing, translation, and compiling
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Probabilistic parsing strategies
Journal of the ACM (JACM)
Hierarchical Phrase-Based Translation
Computational Linguistics
Handbook of Weighted Automata
OpenFst: a general and efficient weighted finite-state transducer library
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Filters for efficient composition of weighted finite-state transducers
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Hierarchical phrase-based translation representations
EMNLP '11 Proceedings of the Conference on Empirical Methods in Natural Language Processing
| Hi-index | 0.00 |
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.