Skip to main content
SpringerLink
Log in

A Declarative Characterization of Different Types of Multicomponent Tree Adjoining Grammars

  • Published:
Research on Language and Computation

Abstract

Multicomponent Tree Adjoining Grammars (MCTAGs) are a formalism that has been shown to be useful for many natural language applications. The definition of non-local MCTAG however is problematic since it refers to the process of the derivation itself: a simultaneity constraint must be respected concerning the way the members of the elementary tree sets are added. Looking only at the result of a derivation (i.e., the derived tree and the derivation tree), this simultaneity is no longer visible and therefore cannot be checked. i.e., this way of characterizing MCTAG does not allow to abstract away from the concrete order of derivation. In this paper, we propose an alternative definition of MCTAG that characterizes the trees in the tree language of an MCTAG via the properties of the derivation trees (in the underlying TAG) the MCTAG licences. We provide similar characterizations for various types of MCTAG. These characterizations give a better understanding of the formalisms, they allow a more systematic comparison of different types of MCTAG, and, furthermore, they can be exploited for parsing.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Becker, T., Joshi, A. K., & Rambow, O. (1991). Long-distance scrambling and tree adjoining grammars. In: Proceedings of ACL-Europe.

  • Boullier, P. (1998). A generalization of mildly context-sensitive formalisms. In Proceedings of the 4th international workshop on tree adjoining grammars and related formalisms (TAG+4) (pp. 17–20). Philadelphia: University of Pennsylvania.

  • Boullier, P. (1999). On TAG parsing. In TALN 99, 6e conférence annuelle sur le Traitement Automatique des Langues Naturelles (pp. 75–84). Cargèse, Corse.

  • Boullier, P. (2000). Range concatenation grammars. In Proceedings of the 6th international workshop on parsing Technologies (IWPT2000) (pp. 53–64). Trento, Italy.

  • Burden, H., & Ljunglöf, P. (2005). Parsing linear context-free rewriting systems. In IWPT’05, 9th international workshop on parsing technologies. Vancouver, Canada.

  • Champollion, L. (2007). Lexicalized non-local MCTAG with dominance links is NP-complete. In G. Penn, & E. Stabler (Eds.), Proceedings of Mathematics of Language (MOL) 10.

  • Chen-Main, J., & Joshi, A. (2007). Some observations on a GGraphicałG model-theoretical approach and generative models. In Model theoretic syntax at 10. Workshop, ESSLLI 2007. Dublin, Ireland.

  • Chiang, D., & Scheffler, T. (2008). Flexible composition and delayed tree-locality. In: TAG+9 Proceedings of the 9th international workshop on tree-adjoining grammar and related formalisms (TAG+9) (pp. 17–24). Tübingen.

  • Joshi A. K. (1987) An introduction to tree adjoining grammars. In: Manaster-Ramer A. (eds) Mathematics of language. John Benjamins, Amsterdam, pp 87–114

    Google Scholar 

  • Joshi A. K., Kallmeyer L., Romero M. (2007) Flexible composition in LTAG: Quantifier scope and inverse linking. In: Muskens R., Bunt H.(eds) Computing meaning Volume 3. Studies in linguistics and philosophy. Springer.

  • Joshi A. K., Levy L. S., Takahashi M. (1975) Tree adjunct grammars. Journal of Computer and System Science 10: 136–163

    Article  Google Scholar 

  • Joshi A. K., Schabes Y. (1997) Tree-adjoning grammars. In: Rozenberg G., Salomaa A. (eds) Handbook of formal languages. Springer, Berlin, pp 69–123

    Google Scholar 

  • Kallmeyer L. (2005) Tree-local multicomponent tree adjoining grammars with shared nodes. Computational Linguistics 31(2): 187–225

    Article  Google Scholar 

  • Kallmeyer L., Joshi A. K. (2003) Factoring predicate argument and scope semantics: Underspecified semantics with LTAG. Research on Language and Computation 1(1–2): 3–58

    Article  Google Scholar 

  • Kallmeyer, L., & Parmentier, Y. (2008). On the relation between multicomponent tree adjoining grammars with tree tuples (TT-MCTAG) and range concatenation grammars (RCG). In: C. Martín-Vide, F. Otto, & H. Fernaus (Eds.), Language and automata theory and applications. 2nd International conference, LATA 2008, No. 5196 in Lecture Notes in Computer Science (pp. 263–274). Heidelberg/Berlin: Springer.

  • Kallmeyer L., Romero M. (2008) Scope and situation binding in LTAG using semantic unification. Research on Language and Computation 6(1): 3–52

    Article  Google Scholar 

  • Kallmeyer, L., & Satta, G. (2009). A polynomial-time parsing algorithm for TT-MCTAG. In Proceedings of ACL. Singapore.

  • Kroch A. S., Joshi A. K. (1987) Analyzing extraposition in a tree adjoining grammar. In: Huck L. Frazier, G. J., Ojeda A. E.(eds) Syntax and Semantics: Discontinuous constituency (pp. 107–149). Elsevier.

  • Lichte, T. (2007). An MCTAG with tuples for coherent constructions in German. In Proceedings of the 12th conference on formal grammar 2007. Dublin, Ireland.

  • Nesson, R., Satta, G., & Shieber, S. (2008). Complexity, parsing, and factorization of tree-local multi-component tree-adjoining grammar. Technical Report TR-05-08, School of Engineering and Applied Sciences, Harvard University, Cambridge, MA.

  • Nesson, R., & Shieber, S. M. (2006). Simpler TAG semantics through synchronization. In Proceedings of the 11th conference on formal grammar. Malaga, Spain.

  • Rambow, O. (1994). Formal and computational aspects of natural language syntax. Ph.D. thesis, University of Pennsylvania.

  • Rambow, O., & Satta, G. (1992) Formal properties of non-locality. In Proceedings of 1st international workshop on tree adjoining grammars. Philadelphia.

  • Seki H., Matsumura T., Fujii M., Kasami T. (1991) On multiple context-free grammars. Theoretical Computer Science 88(2): 191–229

    Article  Google Scholar 

  • Shieber S. M., Schabes Y., Pereira F. C. N. (1995) Principles and implementation of deductive parsing. Journal of Logic Programming 24(1&2): 3–36

    Article  Google Scholar 

  • Søgaard, A., Lichte, T., & Maier, W. (2007). The complexity of linguistically motivated extensions of tree-adjoining grammar. In Recent Advances in Natural Language Processing 2007. Borovets, Bulgaria.

  • Telljohann, H., Hinrichs, E. W., & Kübler, S. (2003). Stylebook for the Tübingen treebank of written German (TüBa-D/Z). Seminar für Sprachwissenschaft, Universität Tübingen, Germany.

  • Vijay-Shanker K., Weir D. J. (1993) Parsing some constrained grammar formalisms. Computational Linguistics 19(4): 591–636

    Google Scholar 

  • Vijay-Shanker K., Weir D. J. (1994) The equivalence of four extensions of context-free grammars. Mathematical Systems Theory 27(6): 511–546

    Article  Google Scholar 

  • Vijay-Shanker, K., Weir, D. J., & Joshi, A. K. (1987). Characterizing structural descriptions produced by various grammatical formalisms. In Proceedings of ACL. Stanford.

  • Villemonte de La Clergerie, E. (2002). Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING’02.

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

Download references

Author information

Authors and Affiliations

  1. Collaborative Research Center 833, University of Tübingen, Nauklerstr. 35, 72074, Tübingen, Germany

    Laura Kallmeyer

Authors
  1. Laura Kallmeyer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Laura Kallmeyer.

About this article

Cite this article

Kallmeyer, L. A Declarative Characterization of Different Types of Multicomponent Tree Adjoining Grammars. Res on Lang and Comput 7, 55–99 (2009). https://doi.org/10.1007/s11168-009-9064-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11168-009-9064-z

Keywords

Search

Navigation