lexicalized tree adjoining grammar
Tài liệu Báo cáo khoa học: "Some Novel Applications of Explanation-Based Learning to Parsing Lexicalized Tree-Adjoining Grammars"" doc
Ngày tải lên :
20/02/2014, 22: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- ... 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 ... specialize a grammar for the ATIS
domain by storing chunks of the parse trees present
in a treebank of parsed examples. The idea is to
reparse the training examples by letting the parse
tree drive...
- 8
- 388
- 0
Tài liệu Báo cáo khoa học: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf
Ngày tải lên :
22/02/2014, 10: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...
- 6
- 370
- 0
Báo cáo khoa học: "Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree" pptx
Ngày tải lên :
17/03/2014, 07: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...
- 6
- 301
- 0
Báo cáo khoa học: "Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy" potx
Ngày tải lên :
17/03/2014, 09:20
... 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 ... 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 ... structure:
TREENODE
:
<> == under
<type> == internal.
STREE:
<> == TREENODE
<cat> == s.
VPTREE:
<> == TREENODE
<cat> ==vp
<parent> == STREE:<>...
- 8
- 349
- 0
Tài liệu Báo cáo khoa học: "Prefix Probabilities from Stochastic Tree Adjoining Grammars*" pptx
Ngày tải lên :
20/02/2014, 18: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 ... 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...
- 7
- 311
- 0
Tài liệu Báo cáo khoa học: "Long-Distance Scrambling and Tree Adjoining Grammars" doc
Ngày tải lên :
22/02/2014, 10:20
...
Contezt-Sensitive Grammar Formalisms. PhD thesis,
Department of Computer and Information Science, Uni-
versity of Pennsylvania.
- 26 -
Long-Distance Scrambling and Tree Adjoining
Grammars*
Tilman ... 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 ... 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 of fl are not ordered...
- 6
- 297
- 0
Tài liệu Báo cáo khoa học: "The Use of Shared Forests in Tree Adjoining Grammar Parsing" pptx
Ngày tải lên :
22/02/2014, 10:20
... 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 ... 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 if it can be derived using ... rules of the grammar. A derivation tree of the
grammar, on the other hand, is a tree that encodes
the sequence of rewritings used in deriving a derived
tree. In the case of cfg, a tree that is...
- 10
- 554
- 0
Báo cáo khoa học: "Strong Lexicalization of Tree Adjoining Grammars" docx
Ngày tải lên :
07/03/2014, 18: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...
- 10
- 322
- 0
Báo cáo khoa học: "Preserving Semantic Dependencies in Synchronous Tree Adjoining Grammar*" doc
Ngày tải lên :
08/03/2014, 06: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 the ... Penn.
References
Anne Abeill6, Yves Schabes, and Aravind K. Joshi.
1990. Using lexicalized tree adjoining grammars
for machine translation. In Proceedings of the
13th International Conference...
- 8
- 261
- 0
Báo cáo khoa học: "Sentence Planning as Description Using Tree Adjoining Grammar " pptx
Ngày tải lên :
08/03/2014, 21:20
... that combine pairs of trees, SUB-
STITUTION and ADJOINING. A TAG grammar consists of
a finite set
of ELEMENTARY
trees, which can be combined
by these substitution and adjoining operations ... 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 ... 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...
- 8
- 180
- 0
Báo cáo khoa học: "A Tree Transducer Model for Synchronous Tree-Adjoining Grammars" pdf
Ngày tải lên :
17/03/2014, 00: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 ... tree-
adjoining grammar essentially is a regular tree
grammar (G
´
ecseg and Steinby, 1984; G
´
ecseg and
NP
DT
les
N
bonbons
N
N
ADJ
rouges
NP
DT
les
N
N
bonbons
ADJ
rouges
derived
tree
auxiliary
tree
adjunction
Figure...
- 10
- 294
- 0
Báo cáo khoa học: "Optimal k-arization of Synchronous Tree-Adjoining Grammar" ppt
Ngày tải lên :
17/03/2014, 02: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 ... 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 ... 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),...
- 9
- 210
- 0
Báo cáo khoa học: "The Relationship Between Tree Adjoining Grammars " pdf
Ngày tải lên :
17/03/2014, 20:20
... MHG's.
1.1.1 Tree Adjoining Grammars
Tree Adjoining Grammars differs from string rewriting sys-
tems
such as Context Free Grammars in that they generate
trees. These trees are generated ... excised
subtree replaces the foot of 8- Thus the tree obtained
after adjoining j3 is as shown below.
5 /3:x s
v
• I
The Relationship Between Tree Adjoining Grammars And Head Grammarst
... elementary trees using the operation of tree ad-
junction. There are two types of elementary trees: initial
and auxiliary. Linguistically, initial trees correspond to
phrase structure trees for...
- 8
- 409
- 0
Báo cáo khoa học: "LICENSING AND TREE ADJOINING GRAMMAR IN GOVERNMENT BINDING PARSING" pdf
Ngày tải lên :
17/03/2014, 20:20
... in a tree adjoining grammar. In A.
Manaster-Ramer, editor, The Mathematics of Lan-
guage, John Benjamins.
[Kroeh, 1987] Anthony Kroch. Assymetries in long
distance extraction in a tree adjoining ... in a tree adjoining grammar.
manuscript, University of Pennsylvania.
[Kroch and Joshi, 1985] Anthony Kroch and Aravind
Joshi. The Linguistic Relevance of Tree Adjoining
Grammar. Technical ... principles of grammar (e.g.
Theta Criterion, Case Filter) which drive structure build-
ing; (2) the working space of the parser is constrained
to the domain determined by a Tree Adjoining Grammar...
- 8
- 283
- 0
