lexicalized tree adjoining grammars

... of our approach to other lexicalized grammars. In Section 8 we conclude with some directions for future work. 2 Lexicalized Tree- Adjoining Grammar Lexicalized Tree- Adjoining Grammar (LTAG) ... Computational Aspects of Lexicalized Grammars. Ph.D. thesis, Com- puter Science Department, University of Pennsylva- nia. Yves Schabes. 1992. Stochastic lexicalized tree- adjoining grammars. In Proceedings ... (l~niladdp~Ja] (2.2) ~ Pbl~ael: (b) (c) Figure 2: (as and/~s) Elementary trees, (a) Derived Tree, (b) Derivation Tree, and (c) Dependency tree for the sentence: show me the flights from Boston to Philadelphia....

Ngày tải lên: 20/02/2014, 22:20

... bidirectional parser for Lexicalized Tree Adjoining Grammars will be presented. The algorithm takes advantage of a peculiar characteristic of Lexicalized TAGs, i.e. that each elementary tree is associated ... 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. Therefore, Lexicalized ... of trees, called initial trees and auxiliary trees respectively. The trees in the set IuA are called elementary trees. We assume that the reader is familiar with the definitions of adjoining...

Ngày tải lên: 22/02/2014, 10:20

... Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree Alexandra KINYON TALANA Universite Paris 7, case 7003, ... derivation trees : 1. Prefer the derivation tree with the fewer number of nodes 2. Prefer to attach an m -tree low 6 3. Prefer the derivation tree with the fewer number of 13 -tree nodes Principle ... same derived tree can be obtained using different derivations. This is why parsing LTAGs yields a derivation tree, from 2 Traditionally initial trees are called o~, and auxiliary trees 13 585...

Ngày tải lên: 17/03/2014, 07:20

... structure: TREENODE : <> == under <type> == internal. STREE: <> == TREENODE <cat> == s. VPTREE: <> == TREENODE <cat> ==vp <parent> == STREE:<> ... tree ad- joining grammar for English. Technical Report IRCS Report 95-03, The Institute for Research in Cognitive Science, Univ. of Pennsylvania. 84 Encoding Lexicalized Tree Adjoining Grammars ... of trees. In ACL-92, 72-80. K. Vijay-Shanker & Yves Schabes. 1992. Structure sharing in lexicalized tree- adjoining grammar. In COLING-92, 205-211. The XTAG Research Group. 1995. A lexicalized...

Ngày tải lên: 17/03/2014, 09:20

... context-free grammars. Computational Linguis- tics, 17(3):315-323. A. K. Joshi and Y. Schabes. 1992. Tree- adjoining gram- mars and lexicalized grammars. In M. Nivat and A. Podelski, editors, Tree ... trees and .A is a set of auxiliary trees. Trees in :TU.A are also called elementary trees. We refer to the root of an elementary tree t as Rt. Each auxiliary tree has exactly one distin- guished ... common wisdom about this failure of CFGs is that trigram models are lexicalized models while CFGs are not. Tree Adjoining Grammars (TAGs) are impor- tant in this respect since they are easily...

Ngày tải lên: 20/02/2014, 18:20

... abbreviatory device for listing a finite set of elementary trees), since it is impossible to adjoin one tree into another tree of the same tree set. There are several other syntactic issues which ... section 4. They also make use of a splitting of the auxiliary tree fl of figure 2, though they split the elementary tree into different tree sets. In particular, the verb and its argu- ments are ... University Linguis- tics Club. [Joshi 1987a] Joshi, Aravind K., 1987. An Introduction to Tree Adjoining Grammars. In Manaster-Ramer, A. (editor), Mathematics of Language. John Benjamins, Amsterdam....

Ngày tải lên: 22/02/2014, 10:20

... only increases by 1. Thus, simple context-free tree grammars strongly lexicalize tree adjoining grammars and themselves. 1 Introduction Tree adjoining grammars [TAG] (Joshi et al., 1969; Joshi et ... 1992. Tree- adjoining grammars and lexicalized grammars. In Maurice Nivat and Andreas Podelski, editors, Tree Au- tomata and Languages. North-Holland. Aravind K. Joshi and Yves Schabes. 1997. Tree- adjoining ... it was shown (KUHLMANN, SATTA: Tree- adjoining grammars are not closed un- der strong lexicalization. Comput. Linguist., 2012) that finitely ambiguous tree adjoining grammars cannot be transformed...

Ngày tải lên: 07/03/2014, 18:20

... assumptions on all tree- adjoining grammars (and synchronous tree- adjoining grammars) . A tree- adjoining grammar (TAG) is a finite set of initial trees and a finite set of auxiliary trees. Our 1070 Jonathan ... synchronous tree- adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer ... M. Shieber. 2004. Synchronous grammars as tree transducers. In Proc. TAG+7, pages 88–95. Stuart M. Shieber. 2006. Unifying synchronous tree adjoining grammars and tree transducers via bimor- phisms....

Ngày tải lên: 17/03/2014, 00:20

Ngày tải lên: 17/03/2014, 20:20

Ngày tải lên: 23/03/2014, 18:20

Ngày tải lên: 23/03/2014, 19:20

Ngày tải lên: 23/03/2014, 19:20

Ngày tải lên: 23/03/2014, 20:21

Ngày tải lên: 24/03/2014, 01:21

Ngày tải lên: 31/03/2014, 01:20

Ngày tải lên: 31/03/2014, 18:20

Ngày tải lên: 31/03/2014, 20:20

Ngày tải lên: 17/03/2014, 22:20

... symbol refinement without heuristics. 3 Symbol-Refined Tree Substitution Grammars In this section, we propose Symbol-Refined Tree Substitution Grammars (SR-TSGs) for syntactic parsing. Our SR-TSG ... rules). The productions take the form of elementary trees i.e., tree fragments of height ≥ 1. The root and internal nodes of the elemen- tary trees are labeled with nonterminal symbols, and leaf ... with other elementary trees. A derivation is a process of forming a parse tree. It starts with a root symbol and rewrites (substi- tutes) nonterminal symbols with elementary trees until there are...

Ngày tải lên: 19/02/2014, 19:20

Ngày tải lên: 20/02/2014, 18:20