Skip to main content
SpringerLink
Log in
Book cover

Conference on Mathematics of Language

MOL 2011: The Mathematics of Language pp 1–20Cite as

Tree Transformations and Dependencies

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6878))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alshawi, H., Bangalore, S., Douglas, S.: Learning dependency translation models as collections of finite state head transducers. Comput. Linguist. 26(1), 45–60 (2000)

    Article  MathSciNet  Google Scholar 

  2. 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)

    Google Scholar 

  3. Arnold, A., Dauchet, M.: Morphismes et bimorphismes d’arbres. Theoret. Comput. Sci. 20(1), 33–93 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  4. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Cambridge (1998)

    Book  MATH  Google Scholar 

  5. Berstel, J., Reutenauer, C.: Recognizable formal power series on trees. Theoret. Comput. Sci. 18(2), 115–148 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  6. Bikel, D.M.: On the Parameter Space of Generative Lexicalized Statistical Parsing Models. Ph.D. thesis, University of Pennsylvania (2004)

    Google Scholar 

  7. 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)

    Article  MathSciNet  MATH  Google Scholar 

  8. Borchardt, B.: The Theory of Recognizable Tree Series. Ph.D. thesis, Technische Universität Dresden (2005)

    Google Scholar 

  9. Charniak, E., Knight, K., Yamada, K.: Syntax-based language models for statistical machine translation. In: Proc. MT Summit IX (2003)

    Google Scholar 

  10. Chiang, D.: An introduction to synchronous grammars. In: Proc. ACL. Association for Computational Linguistics (2006), part of a tutorial given with Kevin Knight

    Google Scholar 

  11. Collins, M.: Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania (1999)

    Google Scholar 

  12. Courcelle, B., Franchi-Zannettacci, P.: Attribute grammars and recursive program schemes. Theoret. Comput. Sci. 17(2-3), 163–191 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  13. Dauchet, M.: Transductions inversibles de forêts. Thèse 3ème cycle, Université de Lille (1975)

    Google Scholar 

  14. 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)

    MathSciNet  MATH  Google Scholar 

  15. Engelfriet, J., Lilin, E., Maletti, A.: Composition and decomposition of extended multi bottom-up tree transducers. Acta Inf. 46(8), 561–590 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  16. Engelfriet, J., Maneth, S.: Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput. 154(1), 34–91 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  17. Engelfriet, J., Maneth, S.: Macro tree translations of linear size increase are MSO definable. SIAM J. Comput. 32(4), 950–1006 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  18. Engelfriet, J., Vogler, H.: Macro tree transducers. J. Comput. System Sci. 31(1), 71–146 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  19. Engelfriet, J., Vogler, H.: Modular tree transducers. Theoret. Comput. Sci. 78(2), 267–303 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  20. Fülöp, Z.: On attributed tree transducers. Acta Cybernet. 5(3), 261–279 (1981)

    MathSciNet  MATH  Google Scholar 

  21. 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)

    Article  MathSciNet  MATH  Google Scholar 

  22. 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)

    Article  MathSciNet  MATH  Google Scholar 

  23. 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)

    Google Scholar 

  24. Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó, Budapest (1984)

    MATH  Google Scholar 

  25. 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)

    Chapter  Google Scholar 

  26. Graehl, J., Knight, K., May, J.: Training tree transducers. Comput. Linguist. 34(3), 391–427 (2008)

    Article  MathSciNet  Google Scholar 

  27. Klein, D., Manning, C.D.: Accurate unlexicalized parsing. In: Proc. ACL, pp. 423–430. Association for Computational Linguistics (2003)

    Google Scholar 

  28. 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)

    Google Scholar 

  29. 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)

    Chapter  Google Scholar 

  30. Knuth, D.E.: Semantics of context-free languages. Math. Systems Theory 2(2), 127–145 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  31. Koehn, P.: Statistical Machine Translation. Cambridge University Press, Cambridge (2010)

    MATH  Google Scholar 

  32. Kuich, W.: Tree transducers and formal tree series. Acta Cybernet. 14(1), 135–149 (1999)

    MathSciNet  MATH  Google Scholar 

  33. 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)

    Chapter  Google Scholar 

  34. Maletti, A.: Compositions of extended top-down tree transducers. Inform. and Comput. 206(9-10), 1187–1196 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  35. Maletti, A.: An alternative to synchronous tree substitution grammars. J. Natur. Lang. Engrg. 17(2), 221–242 (2011)

    Article  MathSciNet  Google Scholar 

  36. Maletti, A.: How to train your multi bottom-up tree transducer. In: Proc. ACL, pp. 825–834. Association for Computational Linguistics (2011)

    Google Scholar 

  37. Maletti, A., Graehl, J., Hopkins, M., Knight, K.: The power of extended top-down tree transducers. SIAM J. Comput. 39(2), 410–430 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  38. Milo, T., Suciu, D., Vianu, V.: Typechecking for XML transformers. J. Comput. System Sci. 66(1), 66–97 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  39. Radmacher, F.G.: An automata theoretic approach to the theory of rational tree relations. Tech. Rep. AIB-2008-05, RWTH Aachen (2008)

    Google Scholar 

  40. Raoult, J.C.: Rational tree relations. Bull. Belg. Math. Soc. 4, 149–176 (1997)

    MathSciNet  MATH  Google Scholar 

  41. Rounds, W.C.: Mappings and grammars on trees. Math. Systems Theory 4(3), 257–287 (1970)

    Article  MathSciNet  MATH  Google Scholar 

  42. Shieber, S.M.: Synchronous grammars as tree transducers. In: Proc. TAG+7, pp. 88–95 (2004)

    Google Scholar 

  43. 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)

    Google Scholar 

  44. Shieber, S.M., Schabes, Y.: Synchronous tree-adjoining grammars. In: Proc. CoLing, vol. 3, pp. 253–258 (1990)

    Google Scholar 

  45. 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)

    Google Scholar 

  46. Thatcher, J.W.: Generalized2 sequential machine maps. J. Comput. System Sci. 4(4), 339–367 (1970)

    Article  MATH  Google Scholar 

  47. 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)

    Google Scholar 

  48. Wu, D.: Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Comput. Linguist. 23(3), 377–403 (1997)

    Google Scholar 

  49. Yamada, K., Knight, K.: A decoder for syntax-based statistical MT. In: Proc. ACL, pp. 303–310. Association for Computational Linguistics (2002)

    Google Scholar 

  50. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, ch. 2, pp. 41–110. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  51. 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)

    Google Scholar 

  52. 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)

    Google Scholar 

  53. 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)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Natural Language Processing, Universität Stuttgart, Azenbergstraße 12, 70174, Stuttgart, Germany

    Andreas Maletti

Authors
  1. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National Institute of Informatics, Tokyo, Japan

    Makoto Kanazawa

  2. Computer and Automation Research Institute, Hungarian Acadamy of Sciences, Budapest, Hungary

    András Kornai

  3. Fakultät Linguistik und Literaturwissenschaft, Universität Bielefeld, Bielefeld, Germany

    Marcus Kracht

  4. Nara Institute of Science and Technology, Graduate School of Information Science, Japan

    Hiroyuki Seki

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation