synchronous tree adjoining grammar
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
...
generative 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. ...
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
2nd ... much context sensitiv-
ity is necessary for characterizing structural de-
scriptions: Tree adjoining grammars. In L. Kart-
tunen D. Dowty and A. Zwicky, editors, Natural
language parsing:...
- 8
- 261
- 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 ... characterization of the expressive power
of synchronous tree- adjoining grammars
(STAGs) in terms of tree transducers (or
equivalently, synchronous tree substitution
grammars) is developed. Essentially, ... detail. A 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 ... the grammar.
The algorithm performs in O(|G| + |Y | · L
3
G
)
time where L
G
is the maximum number of
links in any single synchronous tree pair in
the grammar and Y is the set of synchronous
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...
- 9
- 210
- 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
...
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 ... 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 ... stochastic Tree Adjoining Grammar (STAG)
is represented by a tuple
(NT,
E,:T, .A, ¢) where
NT
is a set of nonterminal symbols, E is a set
of terminal symbols, 2: is a set of
initial
trees...
- 7
- 311
- 0
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-
abes ... (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. ... training corpus.
Auxiliary trees in LTAG represent recursive struc-
tures. So if there is an auxiliary tree that is used in
an LTAG parse, then that tree with the trees for
its arguments can...
- 8
- 388
- 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: "BIDIRECTIONAL PARSING OF LEXICALIZED TREE ADJOINING GRAMMARS" pdf
Ngày tải lên :
22/02/2014, 10:20
... 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 ... to the Production of
O(n 6)
Earley Parsers for Tree Adjoining Grammars. In
Proceedings of the 1st International Workshop on
Tree Adjoining Grammars.
Dagstuhl Castle, F.R.G
Satta, Giorgio, ...
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,...
- 6
- 370
- 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 ... 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 ... 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...
- 10
- 322
- 0
Báo cáo khoa học: "Bayesian Synchronous Tree-Substitution Grammar Induction and its Application to Sentence Compression" pdf
Ngày tải lên :
07/03/2014, 22:20
... syn-
chronous tree- substitution (Eisner, 2003) or tree-
adjoining grammars may better capture the pair-
ings.
In this work, we explore techniques for inducing
synchronous tree- substitution grammars ... paraphrasing.
3 The STSG Model
Synchronous tree- substitution grammar is a for-
malism for synchronously generating a pair of
non-isomorphic source and target trees (Eisner,
2003). Every grammar rule is a ... shieber}@seas.harvard.edu
Abstract
We describe our experiments with training
algorithms for tree- to -tree synchronous
tree- substitution grammar (STSG) for
monolingual translation tasks such as
sentence compression...
- 11
- 424
- 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: "Parsing preferences with Lexicalized Tree Adjoining Grammars : exploiting the derivation tree" pptx
Ngày tải lên :
17/03/2014, 07:20
... 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 ...
or 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. ... 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
... 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 ... NPCOMP:<>.
NPCOMP:
<> == TREENODE
<cat> np
<type> == substitution.
PPTREE:
<> == TREENODE
<cat>
== pp.
PTREE:
<> == TREENODE
<cat> I=
p
<type>...
- 8
- 349
- 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
