scholarly journals The use of shared forests in tree adjoining grammar parsing

Author(s):  
K. Vijay-Shanker ◽  
David J. Weir
2005 ◽  
Vol 12 (3) ◽  
pp. 251-299 ◽  
Author(s):  
JOHN CHEN ◽  
SRINIVAS BANGALORE ◽  
K. VIJAY-SHANKER

There has been a contemporary surge of interest in the application of stochastic models of parsing. The use of tree-adjoining grammar (TAG) in this domain has been relatively limited due in part to the unavailability, until recently, of large-scale corpora hand-annotated with TAG structures. Our goals are to develop inexpensive means of generating such corpora and to demonstrate their applicability to stochastic modeling. We present a method for automatically extracting a linguistically plausible TAG from the Penn Treebank. Furthermore, we also introduce labor-inexpensive methods for inducing higher-level organization of TAGs. Empirically, we perform an evaluation of various automatically extracted TAGs and also demonstrate how our induced higher-level organization of TAGs can be used for smoothing stochastic TAG models.


2012 ◽  
Vol 38 (3) ◽  
pp. 617-629 ◽  
Author(s):  
Marco Kuhlmann ◽  
Giorgio Satta

A lexicalized tree-adjoining grammar is a tree-adjoining grammar where each elementary tree contains some overt lexical item. Such grammars are being used to give lexical accounts of syntactic phenomena, where an elementary tree defines the domain of locality of the syntactic and semantic dependencies of its lexical items. It has been claimed in the literature that for every tree-adjoining grammar, one can construct a strongly equivalent lexicalized version. We show that such a procedure does not exist: Tree-adjoining grammars are not closed under strong lexicalization.


Sign in / Sign up

Export Citation Format

Share Document