licensing and tree adjoining grammar
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
...
Pennsylvania.
[Kroch and Joshi 1:986] Kroch, Anthony and Joshi, At-
avind K., 1986. Analyzing extraposition in a Tree
Adjoining Grammar. In tIuck, G. and Ojeda, A.
(editors), Syntax and Semantics: ...
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 ... motivated grammars,
namely those that exploit the extended domain of lo-
cality and whose trees obey tile constraint of contain-
ing a lexical item and all of its syntactic dependents
(and nothing...
- 6
- 297
- 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 ... (~(t = t').
Also, if a ~ e and dft(N), combining (14)
and (30) gives (again, using previous assump-
958
Prefix Probabilities from Stochastic Tree Adjoining Grammars*
Mark-Jan Nederhof
DFKI...
- 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 ... specify syntactic and semantic
(predicate-argument) constraints. Elementary trees
are of two kinds - (a) INITIAL TREES and (b) AUX-
ILIARY TREES.
Nodes on the frontier of initial trees are marked...
- 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
... 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 ...
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, ... Computational and Theoretical
Perspectives.
Cambridge University Press, New York,
NY.
Kroch, Anthony S. and Joshi, Aravind K., 1985.
Linguistic Relevance of Tree Adjoining Grammars.
Technical...
- 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 ... finite set of initial trees,
A is a finite set of auxiliary trees.
An initial tree is a tree with root labeled by S and
internal nodes and leaf nodes labeled by nonterminal
and terminal symbols, ... 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
... Joshi and Yves Schabes. 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 ... lexicalize
tree adjoining grammars and themselves.
1 Introduction
Tree adjoining grammars [TAG] (Joshi et al., 1969;
Joshi et al., 1975) are a mildly context-sensitive
grammar formalism that can handle ... 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
... Rambow, Wier and Vijay-Shanker them-
selves introduce D -Tree Grammar (Rambow et
al., 1995) and Candito and Kahane introduce
the DTG variant Graph Adjunction Grammar
(Candito and Kahane, 1998b) ... ~, and 7 are elementary trees with node'O, ¢
and ¢ are predicates, X and w be predicate vari-
ables, and T and _1_ are delimiters tbr opening
and closing adjunction, but now let i, j, and ... 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...
- 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
... tree at a distinguished 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 ... substitution and adjoining operations to 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 ... al., 1975) is a grammar formalism built
around two operations that combine pairs of trees, SUB-
STITUTION and ADJOINING. A TAG grammar consists of
a finite set
of ELEMENTARY
trees, which can...
- 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 ... 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 ... regular tree language and
two embedded tree transducers (instead of two tree
homomorphisms). Such embedded tree transduc-
ers (Shieber, 2006) are particular macro tree trans-
ducers (Courcelle and...
- 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
... relative clauses:
Syntax and compositional semantics based on syn-
chronous tree adjoining grammar. In Proceedings
of the 8th International Workshop on Tree Adjoining
Grammars and Related Formalisms ... 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 ... Australia.
Joshi, Aravind K. and Yves Schabes. 1997. Tree-
adjoining grammars. In G. Rozenberg and A. Sa-
lomaa, editors, Handbook of Formal Languages.
Springer, pages 69–124.
Nesson, Rebecca and Stuart M....
- 9
- 210
- 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
... preferences with Lexicalized Tree Adjoining Grammars :
exploiting the derivation tree
Alexandra KINYON
TALANA
Universite Paris 7, case 7003,
2pl Jussieu 75005 Paris France
Alexandra.Kinyon@linguist.jussieu.fr ... such a
tree is an auxiliary tree. Trees that are not
auxiliary are initial. Elementary trees combine
with 2 operations : substitution and
adjunetion.
Substitution is compulsory and is used ...
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)...
- 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:<> ...
rent, an s as its grandparent and an
NP
to the left
of its parent. It also has an NP to its right, and a
tree rooted in a P to the right of that, with a PP
parent and
NP
right sister. ...
from TREENODE and VERB+NP just overrides this com-
plement specification to add an NP complement. Se-
cond, we describe trees using only local tree relations
(between adjacent nodes in the tree) ,...
- 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
... HG's, and 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 ... 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
...
[3] Joshi, A. K., Vijay-Shanker, K., and Weir, D.J. Tree
Adjoining Grammars and Head Grammars.
Techni-
cal Report MS-CIS-86-1, Department of Computer
and Information Science, University of...
- 8
- 409
- 0
