LT World

You are here: Home kb Information & Knowledge Technologies Tree-Adjoining Grammar

Tree-Adjoining Grammar

An Introduction to Tree Adjoining Grammar.
Mathematics of Language.
Joshi, Aravind.
A. Manaster-Ramer. Amsterdam.John Benjamins. 1987.

Tree-adjoining grammar and lexicalized grammars.
Tree automata and languages.
Joshi, Aravind and Schabes, Yves. M. Nivat and A. Podelski. 1992. 409-431.

Tree Adjoining Grammars.
Handbook of Formal Languages and Automata.
Joshi, Aravind and Schabes, Yves. A. Salomma and G. Rosenberg, Heidelberg, Springer Verlag, 1997.

Using descriptions of trees in a tree-adjoining grammar.
K. Vijay-Shanker.
Computational Linguistics. 18 1992. 481-518.

D-LTAG System: Discourse Parsing with a Lexicalized Tree Adjoining Grammar.
Katherine Forbes and Eleni Miltsakaki and Rashmi Prasad and Anoop Sarkar and Aravind Joshi and Bonnie Webber.
Journal of Logic, Language and Information: Special Issue in Discourse and Information Structure. 12. 3. 2003. 261-279.

Tree-Adjoining Grammars and its application to statistical parsing.
Data-oriented parsing.
Anoop Sarkar and Aravind Joshi.
Rens Bod and Remko Scha and Khalil Sima'an, Stanford.CSLI Publications, 2003.

  • Computer and Information Science (CIS)
  • University of Paris 7

  • Vijay K. Shanker
  • Anne Abeillé
  • Owen Rambow
  • Aravind K. Joshi
  • Laura Kallmeyer
  • Tilman Becker
  • Anoop Sarkar
  • Srinivas Bangalore

  • Sentence Planning Using Description (SPUD)
  • SuperTagging without Tears (SuperTagging)
  • Korean XTAG Project (Korean XTAG)
  • XTAG

Tree-Adjoining Grammars (TAGs) are tree rewriting systems. The grammar components are (lexicalised) elementary trees, which are composed by substitution and adjunction operations. The syntactic representation consists of the constituent tree built by composition of elementary trees, and a derivation tree, which records the dependencies between elementary trees as established by substitution and adjunction operations. A basic linguistic assumption underlying TAG is that elementary trees encode basic predicate-argument structure. This extends to long-distance dependencies, which are "localised" in (lexicalised) elementary trees.