Abstract
Several tree transformation devices that are relevant in natural language processing are presented with a focus on the dependencies that they are able to capture. In many cases, the consideration of the dependencies alone can be used to provide a high-level explanation of the short-comings of tree transformation devices and allows surprising insights into their structure.
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
Alshawi, H., Bangalore, S., Douglas, S.: Learning dependency translation models as collections of finite state head transducers. Comput. Linguist. 26(1), 45–60 (2000)
Arnold, A., Dauchet, M.: Bi-transductions de forêts. In: Michaelson, S., Milner, R. (eds.) Proc. ICALP, pp. 74–86. Edinburgh University Press, Edinburgh (1976)
Arnold, A., Dauchet, M.: Morphismes et bimorphismes d’arbres. Theoret. Comput. Sci. 20(1), 33–93 (1982)
Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)
Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18(2), 115–148 (1982)
Bikel, D.M.: On the Parameter Space of Generative Lexicalized Statistical Parsing Models. Ph.D. thesis, University of Pennsylvania (2004)
Bloem, R., Engelfriet, J.: A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. System Sci. 61(1), 1–50 (2000)
Borchardt, B.: The Theory of Recognizable Tree Series. Ph.D. thesis, Technische Universität Dresden (2005)
Charniak, E., Knight, K., Yamada, K.: Syntax-based language models for statistical machine translation. In: Proc. MT Summit IX (2003)
Chiang, D.: An introduction to synchronous grammars. In: Proc. ACL. Association for Computational Linguistics (2006), part of a tutorial given with Kevin Knight
Collins, M.: Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania (1999)
Courcelle, B., Franchi-Zannettacci, P.: Attribute grammars and recursive program schemes. Theoret. Comput. Sci. 17(2-3), 163–191 (1982)
Dauchet, M.: Transductions inversibles de forêts. Thèse 3ème cycle, Université de Lille (1975)
Engelfriet, J., Fülöp, Z., Vogler, H.: Bottom-up and top-down tree series transformations. J. Autom. Lang. Combin. 7(1), 11–70 (2002)
Engelfriet, J., Lilin, E., Maletti, A.: Composition and decomposition of extended multi bottom-up tree transducers. Acta Inf. 46(8), 561–590 (2009)
Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154(1), 34–91 (1999)
Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32(4), 950–1006 (2003)
Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. System Sci. 31(1), 71–146 (1985)
Engelfriet, J., Vogler, H.: Modular tree transducers. Theoret. Comput. Sci. 78(2), 267–303 (1991)
Fülöp, Z.: On attributed tree transducers. Acta Cybernet. 5(3), 261–279 (1981)
Fülöp, Z., Kühnemann, A., Vogler, H.: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead. Inf. Process. Lett. 91(2), 57–67 (2004)
Fülöp, Z., Kühnemann, A., Vogler, H.: Linear deterministic multi bottom-up tree transducers. Theoret. Comput. Sci. 347(1–2), 276–287 (2005)
Fülöp, Z., Maletti, A., Vogler, H.: Preservation of recognizability for synchronous tree substitution grammars. In: Drewes, F., Kuhlmann, M. (eds.) Proc. ATANLP, pp. 1–9. Association for Computational Linguistics (2010)
Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)
Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, ch. 1, pp. 1–68. Springer, Heidelberg (1997)
Graehl, J., Knight, K., May, J.: Training tree transducers. Comput. Linguist. 34(3), 391–427 (2008)
Klein, D., Manning, C.D.: Accurate unlexicalized parsing. In: Proc. ACL, pp. 423–430. Association for Computational Linguistics (2003)
Klein, D., Manning, C.D.: Fast exact inference with a factored model for natural language parsing. In: Proc. NIPS, pp. 3–10. MIT Press, Cambridge (2003)
Knight, K., Graehl, J.: An overview of probabilistic tree transducers for natural language processing. In: Gelbukh, A. (ed.) CICLing 2005. LNCS, vol. 3406, pp. 1–24. Springer, Heidelberg (2005)
Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2(2), 127–145 (1968)
Koehn, P.: Statistical Machine Translation. Cambridge University Press, Cambridge (2010)
Kuich, W.: Tree transducers and formal tree series. Acta Cybernet. 14(1), 135–149 (1999)
Lilin, E.: Propriétés de clôture d’une extension de transducteurs d’arbres déterministes. In: Astesiano, E., Böhm, C. (eds.) CAAP 1981. LNCS, vol. 112, pp. 280–289. Springer, Heidelberg (1981)
Maletti, A.: Compositions of extended top-down tree transducers. Inform. and Comput. 206(9-10), 1187–1196 (2008)
Maletti, A.: An alternative to synchronous tree substitution grammars. J. Natur. Lang. Engrg. 17(2), 221–242 (2011)
Maletti, A.: How to train your multi bottom-up tree transducer. In: Proc. ACL, pp. 825–834. Association for Computational Linguistics (2011)
Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410–430 (2009)
Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. System Sci. 66(1), 66–97 (2003)
Radmacher, F.G.: An automata theoretic approach to the theory of rational tree relations. Tech. Rep. AIB-2008-05, RWTH Aachen (2008)
Raoult, J.C.: Rational tree relations. Bull. Belg. Math. Soc. 4, 149–176 (1997)
Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory 4(3), 257–287 (1970)
Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. TAG+7, pp. 88–95 (2004)
Shieber, S.M.: Probabilistic synchronous tree-adjoining grammars for machine translation: The argument from bilingual dictionaries. In: Proc. SSST, pp. 88–95. Association for Computational Linguistics (2007)
Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proc. CoLing, vol. 3, pp. 253–258 (1990)
Sun, J., Zhang, M., Tan, C.L.: A non-contiguous tree sequence alignment-based model for statistical machine translation. In: Proc. ACL. pp. 914–922. Association for Computational Linguistics (2009)
Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. System Sci. 4(4), 339–367 (1970)
Thatcher, J.W.: Tree automata: An informal survey. In: Aho, A.V. (ed.) Currents in the Theory of Computing, pp. 143–172. Prentice Hall, Englewood Cliffs (1973)
Wu, D.: Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Comput. Linguist. 23(3), 377–403 (1997)
Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: Proc. ACL, pp. 303–310. Association for Computational Linguistics (2002)
Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 2, pp. 41–110. Springer, Heidelberg (1997)
Zhang, M., Jiang, H., Aw, A., Li, H., Tan, C.L., Li, S.: A tree sequence alignment-based tree-to-tree translation model. In: Proc. ACL, pp. 559–567. Association for Computational Linguistics (2008)
Zhang, M., Jiang, H., Li, H., Aw, A., Li, S.: Grammar comparison study for translational equivalence modeling and statistical machine translation. In: Proc. CoLing, pp. 1097–1104. Association for Computational Linguistics (2008)
Zollmann, A., Venugopal, A., Och, F., Ponte, J.: A systematic comparison of phrase-based, hierarchical and syntax-augmented statistical MT. In: Proc. CoLing, pp. 1145–1152. Association for Computational Linguistics (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maletti, A. (2011). Tree Transformations and Dependencies. In: Kanazawa, M., Kornai, A., Kracht, M., Seki, H. (eds) The Mathematics of Language. MOL 2011. Lecture Notes in Computer Science(), vol 6878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23211-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-23211-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23210-7
Online ISBN: 978-3-642-23211-4
eBook Packages: Computer ScienceComputer Science (R0)