[PDF] Top 20 Some Computational Properties of Tree Adjoining Grammars

... Similarly, the base ease need not consider only elementary trees, but the smalleat in terms of the number of adjoining operations tree starting with elementary trees which h,m no obligat[r] ... See full document

... SOME COMPUTATIONAL PROPERTIES OF TREE ADJOINING GRAMMARS S O M E C O M P U T A T I O N A L P R O P E R T I E S O F T R E E A D J O I N I N G G R A M M A R S * K V i j a y S h a n k l t r a n d A r ~ v[.] ... See full document

... "Parsing strategies with 'lexicalized' grammars: application to tree adjoining grammars." In Proceedings, 12th International Conference on Computational Linguistics.. Schabes, Yves, and [r] ... See full document

... FACTORING RECURSION AND DEPENDENCIES: AN ASPECT OF TREE ADJOINING GRAMMARS TAG AND A COMPARISON OF SOME FORMAL PROPERTIES OF TAGS, GPSGS, PLGS, AND LPGS *.. Joshi of Computer and Informa[r] ... See full document

... Tree adjoining grammars [TAG] (Joshi et ...formal properties, their lin- guistic motivation, and their applications is pre- sented by Joshi and Schabes (1992) and Joshi and Schabes (1997), in ... See full document

... or tree-local and set-local MCTAG, such constraints result from the form of the elementary structures and from the locality of the derivation ...general properties of the grammar, and they need not be ... See full document

... the computational strength of such mod- ules can be measured only in terms of the tree lan- guages they accept and the transductions between tree languages that they ... See full document

... Ilere, "naturally" means t h a t dependencies are stated within the larger domain of lo- cality the elementary tree, i.e., each clausal tree still contains a verb and all of its argument[r] ... See full document

... Parsing Strategies with 'Lexicalized' Grammars Application to Tree Adjoining Grammars P a r s i n g S t r a t e g i e s w i t h ' L e x i c a l i z e d ' G r a m m a r s A p p l i c a t i o n t o T r[.] ... See full document

... The probability model defined by a probabilistic grammar is said to be consistent if the probabilities assigned to all the strings in the language sum to 1.. Much of the power of probabi[r] ... See full document

... It is obvious that this invariant consisting of the nonterminal in a cell of the triangle matrix to represent the context-free invariant, the pointers to elementary trees, and the foot n[r] ... See full document

... Conditions on Consistency of Probabilistic Tree Adjoining Grammars C o n d i t i o n s o n C o n s i s t e n c y o f P r o b a b i l i s t i c T r e e A d j o i n i n g G r a m m a r s * A n o o p S a[.] ... See full document

... Coordination in Tree Adjoining Grammars Formalization and Implementation C o o r d i n a t i o n in Tree A d j o i n i n g G r a m m a r s F o r m a l i z a t i o n and I m p l e m e n t a t i o n * A[.] ... See full document

... Structure Sharing in Lexicalized Tree Adjoining Grammars Structure Sharing in Lexicalized Tree Adjoining Graulmars* K V i j a y S h a n k e r Dept of C o m p u t e r & In fo rmatio n Science Universit[.] ... See full document

... The last one is in fact the most important: the closure u n d e r logical adjunction and substitution of the set of sequents corresponding to a set of elementary trees is exactly the set[r] ... See full document

... Probabilistic tree-adjoining grammars (PTAG) (Schabes, 1992; Resnik, 1992) assign to every de- rived tree an associated probability. They can also be incorporated into Vanda by an appropriate ... See full document

... Lexicalized Tree Adjoining Grammars Schabes et al., 1988 are a refinement of TAGs such that each elementary tree is associated with a lexieal item, called the anchor of the tree.. Theref[r] ... See full document

... for tree trans- formations, however they are not suitably ex- pressive for all applications in machine transla- tion (Shieber, ...all tree trans- formations of XTT have a certain locality condi- tion, which ... See full document

... So if there is an auxiliary tree that is used in an LTAG parse, then that tree with the trees for its arguments can be repeated any number of times, or possibly omitted altogether, to ge[r] ... See full document

... synchronous tree- adjoining grammars, partial solutions to this problem have been described, some being restricted to the unweighted case, some to the monolingual ...of grammars ... See full document