[PDF] Top 20 MIX Is Not a Tree Adjoining Language

... Mild context-sensitivity is an informally defined no- tion first introduced by Joshi (1985); it consists of the three conditions of limited cross-serial depen- dencies, constant growth, and polynomial parsing. The first ... See full document

... elementary tree has a lexical anchor (usually unique, but in some cases, there is more than one ...elementary tree minimality from (Frank, 1992). The tree for laughs in Figure 1, for example, ... See full document

... of Tree- Tuple MCTAG with Shared Nodes, TT- MCTAG for short, an extension of Tree Adjoining Grammars that has been pro- posed for natural language processing, in particular for dealing with ... See full document

... ACGs provide a framework in which several grammatical formalisms may be encoded (de Groote and Pogodalla, 2004). They generate lan- guages of linear λ-terms, which generalize both string and tree languages. A key ... See full document

... alphabet, each production of a lexicalized gram- mar produces at least one letter of the generated string. Consequently, lexicalized grammars offer significant parsing benefits (Schabes et al., 1988) as the number of ... 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

... 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

... Thirdly, inconsistent ordering relations within and across phrasal categories characterize Thai sentences. Based on word order typology, the majority of the world’s languages usually exhibit consistent ordering ... See full document

... derivation tree, arbitrarily many trees can be secondary SN-daughters of a single elementary tree, such that these secondary links are considered to be adjunctions to that ...elementary tree is ... 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

... (or tree-based) ...Top-down tree transduc- ers (Rounds, 1970; Thatcher, 1970) have been heavily investigated in the formal language com- munity (G´ecseg and Steinby, 1984; G´ecseg and Steinby, 1997), ... See full document

... Syntax-based translation models, which exploit hi- erarchical structures of natural languages to guide machine translation, have become increasingly pop- ular in recent years. So far, most of them have been based on ... 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

... PROBABILISTIC TREE ADJOINING GRAMMAR AS A FRAMEWORK FOR STATISTICAL NATURAL LANGUAGE PROCESSING 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 A S A F R A M E W O R K F O R S T A T[.] ... See full document

... Current tree-based models that integrate lin- guistics and statistics, such as GHKM (Galley et al., 2004), are not able to generalize well from a single phrase pair. For example, from the data in Figure 1, GHKM ... 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

... 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

... 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

... 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

... The particular proposal is both precisely characterizable through a definition of TAG derivations as equivalence classes of ordered derivation trees, and computationally operational, by [r] ... See full document