Related Topics
Publications (10)

1Feature Structures Based Tree Adjoining Grammars1988  K. VijayShanker,Aravind K. Joshiminimal recursive constructions. Thus, if the root of an auxiliary tree is labelled by a nonterminal symbol, X, then there...

2Parsing Strategies with 'Lexicalized' Grammars: Application to Tree Adjoining Grammarsadjoining or adjunct ion. I t builds a new tree from an auxiliary tree # and a tree c~ (a is any tree, initial, auxiliary or...

3Tree Adjoining and Head Wrappingthe foot node, all the nodes in the frontier of an auxiliary tree are labelled by terminal symbols. The foot node is labelled...

4Using Lexicalized Tags for Machine Translationto be substituted, '*' annotates the foot node of an auxiliary tree and the hadices shown on the nodes correspond to semantic...

5Probabilistic TreeAdjoining Grammar As A Framework For Statistical Natural Language Processing1992  Philip Resniktrees are labelled using cr and f3, respectively.) An auxiliary tree, by definition, has a uonterminal node on its frontier...

6Parsing French with Tree Adjoining Grammar: some linguistic accounts1988  Anne AbeilleAravind Joshl, Anthony Kroch, and Yves Schahes. serts an auxiliary tree at one of the corresponding nodes of an elementary or...

7Stochastic Lexicalized Treeadjoining Grammars1992  Yves Schabestakes place at node q. o If t/ is an node on which the auxiliary tree fl can be adjoined, the adjunetiou of fl can be predicted...

8Coordination in Tree Adjoining Grammars: Formalization and Implementation1996  Anoop Sarkar,Aravind Joshioc~ cur. The notation , marks tile foot node of an auxiliary tree. Making this explicit we c~m view an elementary tree...

9Synchronous TreeAdjoining Grammars1990  Stuart M. Shieber,Yves SchabesReport MSCIS8518, Department of Computer and Information Science, University of Pennsylvania, April. Anthony Kroch. 1989...

10