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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: The Theory of Parsing, Translation and Compiling, vol. 1-2. Prentice-Hall (1972)
Allauzen, C., Riley, M.: Pushdown Transducers (2011), http://pdt.openfst.org
Allauzen, C., Riley, M., Schalkwyk, J.: Filters for Efficient Composition of Weighted Finite-State Transducers. In: Domaratzki, M., Salomaa, K. (eds.) CIAA 2010. LNCS, vol. 6482, pp. 28–38. Springer, Heidelberg (2011)
Allauzen, C., Riley, M., Schalkwyk, J., Skut, W., Mohri, M.: OpenFst: A General and Efficient Weighted Finite-State Transducer Library. In: Holub, J., Žďárek, J. (eds.) CIAA 2007. LNCS, vol. 4783, pp. 11–23. Springer, Heidelberg (2007), http://www.openfst.org
Bar-Hillel, Y., Perles, M., Shamir, E.: On formal properties of simple phrase structure grammars. In: Bar-Hillel, Y. (ed.) Language and Information: Selected Essays on their Theory and Application, pp. 116–150. Addison-Wesley (1964)
Berstel, J.: Transductions and Context-Free Languages. Teubner (1979)
Chen, S.F.: Designing a non-finite-state weighted transducer toolkit. Technical Report RC 24829, IBM Research Division (2009)
Chiang, D.: Hierarchical phrase-based translation. Computational Linguistics 33(2), 201–228 (2007)
Drosde, M., Kuick, W., Vogler, H. (eds.): Handbook of Weighted Automata. Springer (2009)
Hall, K., Johnson, M.: Language modeling using efficient best-first bottom-up parsing. In: Proceedings of ASRU (2003)
Iglesias, G., Allauzen, C., Byrne, W., de Gispert, A., Riley, M.: Hierarchical phrase-based translation representations. In: Proc. EMNLP, pp. 1373–1383 (2011)
Kuich, W., Salomaa, A.: Semirings, automata, languages. Springer (1986)
Lang, B.: Deterministic Techniques for Efficient Non-Deterministic Parsers. In: Loeckx, J. (ed.) ICALP 1974. LNCS, vol. 14, pp. 255–269. Springer, Heidelberg (1974)
Maryanski, F.J., Thomason, M.G.: Properties of stochastic syntax-directed translation schemata. International Journal of Computer and Information Sciences 8(2), 89–110 (1979)
Mohri, M.: Weighted grammar tools: the GRM library. In: Robustness in Language and Speech Technology, pp. 165–186. Kluwer (2001)
Mohri, M.: Weighted automata algorithms. In: Drosde, et al. [9], ch. 6, pp. 213–254
Mohri, M., Pereira, F.C.N., Riley, M.: Weighted finite-state transducers in speech recognition. Computer Speech and Language 16(1), 69–88 (2002)
Nederhof, M.-J., Satta, G.: Probabilistic parsing as intersection. In: Proceedings of 8th International Workshop on Parsing Technologies, pp. 137–148 (2003)
Nederhof, M.J., Satta, G.: Probabilistic parsing strategies. Journal of the ACM 53(3), 406–436 (2006)
Petre, I., Salomaa, A.: Algebraic systems and pushdown automata. In: Drosde, et al [9], ch. 7, pp. 257–289
Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics 21(2), 165–201 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Allauzen, C., Riley, M. (2012). A Pushdown Transducer Extension for the OpenFst Library. In: Moreira, N., Reis, R. (eds) Implementation and Application of Automata. CIAA 2012. Lecture Notes in Computer Science, vol 7381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31606-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-31606-7_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31605-0
Online ISBN: 978-3-642-31606-7
eBook Packages: Computer ScienceComputer Science (R0)