parsing with lexicalized tree adjoining grammar

... Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree Alexandra KINYON TALANA Universite Paris 7, ... initial 2. A tree has at most 1 foot-node, such a tree is an auxiliary tree. Trees that are not auxiliary are initial. Elementary trees combine with 2 operations : substitution and adjunetion. ... parsing LTAGs yields a derivation tree, from 2 Traditionally initial trees are called o~, and auxiliary trees 13 585 which a derived tree (i.e. constituent tree) can be obtained. (Figure 1)...

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

... Lexicalization to Parsing. In Proceedings of the 1st International Workshop on Parsing Technologies. Pittsburgh, PA. To also appear under the title: Parsing with Lexicalized Tree Adjoining Grammar. ... 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

... 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) (Sch- ... Schabes, Anne Abeill~, aJad Aravind K. Joshi. 1988. parsing strategies with &apos ;lexicalized& apos; grammars: Application to "l~ee Adjoining Grammars. In Pro- ceedings of the 12 *4 International ... 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...

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

... Vijay-Shanker. 1992. Reasoning .with descriptions 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. ... structure: TREENODE : <> == under <type> == internal. STREE: <> == TREENODE <cat> == s. VPTREE: <> == TREENODE <cat> ==vp <parent> == STREE:<> ... A lexicalized 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...

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

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

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

... deal with ill-formed inputs. 5 Derivation versus Derived Trees in TAG For grammar formalisms involving the derivation of trees, a tree is called a derived tree with respect to a given grammar ... existing tag parsing algorithms, 1 Introduction We study parsing of tree adjoining grammars (tag) with particular emphasis on the use of shared forests to represent all the parse trees deriving ... auxiliary tree is called the spine of the auxiliary tree. An elementary tree is either an initial tree or an auxiliary tree. We use a to refer to initial trees and/3 for auxiliary trees. A...

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

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

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

... pair, (b) a tree transformation based mapping, and (c) a tree trans- ducer that performs the mapping. volve tree transformations either between two trees or a tree and a string. The tree transducer, ... language. A regular tree grammar (RTG) closely resembles a context free grammar (CFG), and is a way of de- scribing a language of trees. Formally, define T Σ as the set of trees with symbols from ... and grammars on trees. Mathe- matical Systems Theory 4, pages 257–287, 1970. Stuart M. Shieber. Synchronous grammars as tree trans- ducers. In Proc. of the Seventh International Workshop on Tree...

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

... auxiliary trees with empty yield case of lexicalized TAGs. However, in the com- putation of the prefix probability we must take into account trees with non-empty yield which behave like trees with ... 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...

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

... gram- mars: in particular, with grammars admitting less ambiguity parse time will tend to increase more slowly with increasing input length, and also with smaller grammars rule application ... exponential com- plexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results ... SWAPPING THE GRAMMARS OVER A second experiment was carried out with the CLE parser, in which the built-in grammar and lexicon were replaced by versions of the ANLT ob- ject grammar and lexical...

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

... Abeill~, Anne; and Joshi, Aravind: K., August 1988. Parsing Strategies with 'Lexiealized' Grammars: Application to Tree Ad- joining Grammars. In Proceedings of the 12 th Interna- tional ... elementary trees of TAG, allows us to "lexicalize" a TAG gram- mar: we can associate each tree in a grammar with a lexical item [Schabes et al 1988, Schabes 1990] 4. The tree will ... only be stated with respect to the nodes of an elementary tree; it is impossible to relate nodes in dif- ferent trees. When an auxiliary tree fl is adjoined into an initial tree et, the nodes...

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 ... grammars. In Proc. 8th Int. Workshop Tree Adjoining Grammars and Related Formalisms, pages 121–126. ACL. Marco Kuhlmann and Giorgio Satta. 2012. Tree- adjoining grammars are not closed under strong...

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

... capability of synchronous tree adjoin- ing grammars. Computational Intelligence, 10(4). K. Vijay-Shanker and D.J. Weir. 1993. The use of shared forests in tree adjoining grammar parsing. In Proceedings ... August. Aravind Joshi and K. Vijay-Shanker. 1999. Com- positional Semantics with Lexicalized Tree- Adjoining Grammar (LTAG): How Much Under- specification is Necessary? In Proceedings of ... substitution of initial tree a¢ with predicate variable w into "),¢ at node address U, emit (¢, arg(v , r/), w) • For each modifier adjunction of auxil- iary tree/ 3¢ into tree V¢ with predicate...

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

... produce derived trees recognized by the grammar. In substitu- tion, the root of the first tree is identified with a leaf of the second tree, called the substitution site. Adjoining is a more ... leaf called the FOOT node. Elementary trees without foot nodes are called INITIAL trees and can only substitute; trees with foot nodes are called AUXILIARY trees, and must adjoin. (The symbol ... operation, where the first tree replaces the subtree of the second tree rooted at a node called the adjunction site; that subtree is then substituted back into the first tree at a distinguished...

Ngày tải lên: 08/03/2014, 21: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 ... adjunction. A derivation is a chain of trees that starts with an initial tree and each derived tree is obtained from the previous one in the chain by adjunction of an auxiliary tree. As in Shieber (2006)...

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

... tree adjoining grammar. In Proceedings of the 8th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+ 8), pages 41–48, Sydney, Australia. Han, Chung-Hye. 2006b. A tree ... 2006. The hid- den TAG model: synchronous grammars for parsing resource-poor languages. In Proceedings of the 8th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+ 8), ... Australia. Han, Chung-Hye. 2006b. A tree adjoining grammar analysis of the syntax and semantics of it-clefts. In Proceedings of the 8th International Workshop on Tree Adjoining Grammars and Related Formalisms...

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

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

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