[PDF] Top 20 Restrictions on Tree Adjoining Languages

... Thus there can be no more than one complement adjunction site on the spine of any complement auxiliary tree, and no complement adjunction site on the spine of any athematic auxiliary tre[r] ... See full document

... Restrictions on Tree Adjoining Languages R e s t r i c t i o n s o n T r e e A d j o i n i n g L a n g u a g e s Giorgio Satta Dip di E l e t t r o n i c a e I n f o r m a t i c a U n i v e r s i t ?[.] ... See full document

... Consequently, either Tree Adjoining Grammars, as currently defined, fail to generate the class of natural languages in a way that discriminates between linguistically warranted sublangua[r] ... See full document

... An LTAG comprises a morphological and syntactic lexi- con and a large repository of elementary trees. In order to take into account the reusability and possible multilingual applications, the lexicon of vnLTAG uses a ... See full document

... Tree adjoining grammars [TAG] (Joshi et al., 1969; Joshi et al., 1975) are a mildly context-sensitive grammar formalism that can handle certain non- local dependencies (Kuhlmann and Mohl, 2006), which occur ... See full document

... Abstract We propose an OMn2 time algorithm for the recognition of Tree Adjoining Languages TALs, where n is the size of the input string and Mk is the time needed to multiply two k x k b[r] ... See full document

... a tree-to-string rule, rule matching is to find a subtree of the input tree that is identical to the source side of the ...derived tree is straightforward, it is some- what non-trivial for STAG rules ... See full document

... free languages (Seki et al., 1991), or equivalently, languages of linear context-free rewriting systems (Vijay-Shanker et ...context-sensitive languages, or we should revise our conception of limited ... 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 ...regular tree languages, ... See full document

... A Descriptive Characterization of Tree Adjoining Languages (Project Note) A Descriptive Characterization of Tree Adjoining Languages (Project Note) James Rogers D e p t o f C o m p u t e r S c i e n c[.] ... See full document

... Thus there are analogous classes of automata at the level of labeled three-dimensional tree manifolds, the level of labeled trees and at the level of strings which can be understood as t[r] ... See full document

... the tree languages generated by context-free hyperedge-replacement graph gram- mars and the latter family is identical with the output languages of logical tree-to-tree transductions ... See full document

... The generalization described in what follows seems less straightforward. Context-free lan- guages can be characterized in terms of parse trees in which path sets (sets of strings of labels on paths from the root to a ... See full document

... The entry in the action table can have one of the following five values: • Shift j s j, where j is a state; • Resume Right of 6 at address dot rs6@dot, where 6 is an elementary tree and [r] ... See full document

... In this paper, we propose a redefinition of TAG derivation along these lines, whereby multiple auxiliary trees of modification can be adjoined at a single node, whereas only a single auxiliary tree of predication ... See full document

... Linguistically, the outermost method specifies that if both a predicative tree and a modifier tree are adjoined at a single node, then the predicative tree attaches "higher" than the mod[r] ... See full document

... In figure 1, for example, this rules out adjunction of /31 into the spine of/33, or vice versa, either directly or indirectly by adjunction of/33, say, into f12 and then adjunction of th[r] ... See full document

... Stochastic Lexicalized Tree adjoining Grammars Grammaires Stochastiques Lexicalisdes d'Arbres Adjoints Rdsumd du papier Stochastic Lexicalized Tree adjoining Grammars Yves Schabes M o t i v a t i o n[.] ... See full document

... Linguistically, the outermost method specifies that if both a predicative tree and a modifier tree are adjoined at a single node, then the predicative tree attaches "higher" than the mod[r] ... See full document

... Constraining Tree Adjoining Grammars by Unification C o n s t r a i n i n g Tree A d j o i n i n g G r a m m a r s by U n i f i c a t i o n K a r i n H a r b u s c h Deutsches F o r s c h u n g s z e[.] ... See full document