A tree generating system called tree-adjoining grammar (TAG) is described and a number of formal results have been established for TAGs, which are of interest to researchers in formal languages and automata, including those interested in tree grammars and tree automata.Expand

A constructive procedure is presented for converting a CFG into a left anchored LTIG that preserves ambiguity and generates the same trees and it was possible to parse more quickly with the LTIGs than with the original CFGs.Expand

This work presents a system for generating parsers based directly on the metaphor of parsing as deduction, which generalizes easily to parsers for augmented phrase structure formalisms, such as definite-clause grammars and other logic grammar formalisms.Expand

A variant of TAGs is presented, called synchronous TAGs, which characterize correspondences between languages, to allow TAGs to be used beyond their role in syntax proper.Expand

The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of constituent information in a partially parsed corpus to achieve faster convergence and better modelling of hierarchical structure than the original one.Expand

A novel general parsing strategy for 'lexicalized' grammars is discussed and it is argued that even if one extends the domain of locality of CFGs to trees, using only substitution does not give the freedom to choose the head of each structure.Expand

Preliminary experiments showing some of the advantages of SLTAG over stochastic context-free grammars are reported and an algorithm for computing the probability of a sentence generated by a SLTAG and an inside-outside-like iterative algorithm for estimating the parameters of a SL TAG are reported.Expand

The view that syntactic rules are not separated from lexical items is explored, and how lexicalized grammars suggest a natural two-step parsing strategy is shown.Expand

The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of constituent information (constituent bracketing) in a partially parsed corpus to achieve faster convergence and better modeling of hierarchical structure than the original one.Expand

A tree generating system called tree-adjoining grammar(TAG) is described and some of the recent results about TAGs are state, which would be of interest to researchers in tree grammars and tree automata.Expand