Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2017: Fundamentals of Computation Theory pp 217–229Cite as

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10472))

Abstract

Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoining grammars and that both allow strong lexicalization.

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   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

References

  1. Engelfriet, J., Maneth, S.: Tree languages generated by context-free graph grammars. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 15–29. Springer, Heidelberg (2000). doi:10.1007/978-3-540-46464-8_2

    Chapter  Google Scholar 

  2. Engelfriet, J., Schmidt, E.M.: IO and OI I. J. Comput. Syst. Sci. 15(3), 328–353 (1977)

    Article  MathSciNet  MATH  Google Scholar 

  3. Fujiyoshi, A.: Epsilon-free grammars and lexicalized grammars that generate the class of the mildly context-sensitive languages. In: Proceedings of the 7th International Workshop on Tree Adjoining Grammar and Related Formalisms, pp. 16–23 (2005)

    Google Scholar 

  4. Gécseg, F., Steinby, M.: Tree languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 3, chap. 1, pp. 1–68. Springer, Heidelberg (1997). doi:10.1007/978-3-642-59126-6_1

  5. Joshi, A.K., Levy, L.S., Takahashi, M.: Tree adjunct grammars. J. Comput. Syst. Sci. 10(1), 136–163 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  6. Joshi, A.K., Schabes, Y.: Tree-adjoining grammars and lexicalized grammars. In: Nivat, M., Podelski, A. (eds) Tree Automata and Languages, pp. 409–431. North-Holland (1992)

    Google Scholar 

  7. Kallmeyer, L.: Parsing Beyond Context-Free Grammars. Cognitive Technologies. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14846-0

    Book  MATH  Google Scholar 

  8. Kanazawa, M.: Second-order abstract categorial grammars as hyperedge replacement grammars. J. Log. Lang. Inf. 19(2), 137–161 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  9. Kepser, S., Rogers, J.: The equivalence of tree adjoining grammars and monadic linear context-free tree grammars. J. Log. Lang. Inf. 20(3), 361–384 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  10. Kuhlmann, M.: Dependency Structures and Lexicalized Grammars: An Algebraic Approach. LNCS (LNAI), vol. 6270. Springer, Heidelberg (2010)

    MATH  Google Scholar 

  11. Kuhlmann, M., Satta, G.: Tree-adjoining grammars are not closed under strong lexicalization. Comput. Linguist. 38(3), 617–629 (2012)

    Article  MathSciNet  Google Scholar 

  12. Maletti, A., Engelfriet, J.: Strong lexicalization of tree adjoining grammars. In: Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics, pp. 506–515. ACL (2012)

    Google Scholar 

  13. Mönnich, U.: Adjunction as substitution: an algebraic formulation of regular, context-free and tree adjoining languages. In: Proceedings of the 3rd International Conference on Formal Grammar, pp. 169–178. Université de Provence, France (1997)

    Google Scholar 

  14. Rambow, O., Satta, G.: Independent parallelism in finite copying parallel rewriting systems. Theor. Comput. Sci. 223(1–2), 87–120 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  15. Rounds, W.C.: Context-free grammars on trees. In: Proceedings of the 1st ACM Symposium on Theory of Computation, pp. 143–148. ACM (1969)

    Google Scholar 

  16. Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theor. Comput. Sci. 88(2), 191–229 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  17. Vijay-Shanker, K., Weir, D.J., Joshi, A.K.: Characterizing structural descriptions produced by various grammatical formalisms. In: Proceedings of the 25th Annual Meeting of the Association for Computational Linguistics, pp. 104–111. ACL (1987)

    Google Scholar 

  18. Weir, D.J.: Characterizing mildly context-sensitive grammar formalisms. Ph.D. thesis, University of Pennsylvania (1988)

    Google Scholar 

Download references

Acknowledgment

We are grateful to the reviewers for their constructive comments.

Author information

Authors and Affiliations

  1. LIACS, Leiden University, P.O. Box 9512, 2300 RA, Leiden, The Netherlands

    Joost Engelfriet

  2. Universität Leipzig, P.O. Box 100 920, 04009, Leipzig, Germany

    Andreas Maletti

Authors
  1. Joost Engelfriet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Maletti
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Andreas Maletti .

Editor information

Editors and Affiliations

  1. CNRS, University of Bordeaux, Talence cedex, France

    Ralf Klasing

  2. LaBRI, University of Bordeaux, Talence cedex, France

    Marc Zeitoun

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer-Verlag GmbH Germany

About this paper

Cite this paper

Engelfriet, J., Maletti, A. (2017). Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. In: Klasing, R., Zeitoun, M. (eds) Fundamentals of Computation Theory. FCT 2017. Lecture Notes in Computer Science(), vol 10472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-55751-8_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-55751-8_18

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-55750-1

  • Online ISBN: 978-3-662-55751-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation