synchronous tree adjoining grammars
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, ... 253–258.
Stuart 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....
- 10
- 294
- 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 ... 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: "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- ... 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 ... (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....
- 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
... 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 ... 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. ... Scrambling and Tree Adjoining Gram-
mars. Unpublished Paper, University of Pennsylvania.
[Schabes 1990] Schabes, Yves, August 1990. Mathemati-
cal and Computational Aspects of Lezicalized Grammars. ...
- 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
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: "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. ... 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: ... Proceedings of the TAG+4
Workshop.
Stuart M. Shieber and Yves Schabes. 1990. Syn-
chronous tree adjoining grammars. In Proceedings
of the 13th International Conference on Compu-
tational Linguistics...
- 8
- 261
- 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 maximum number of
links in any single synchronous tree pair in
the grammar and Y is the set of synchronous
tree pairs of G.
1 Introduction
Tree- adjoining grammar is a widely used formal-
ism ... multiple context-free grammars. Theoretical Com-
puter Science, 88:191–229.
Shieber, Stuart M. 1994. Restricting the weak-generative
capacity of synchronous tree- adjoining grammars.
Computational...
- 9
- 210
- 0
Tài liệu Báo cáo khoa học: "Bayesian Symbol-Refined Tree Substitution Grammars for Syntactic Parsing" pptx
Ngày tải lên :
19/02/2014, 19: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 ... Parsing. Computational Lin-
guistics, 29:589–637.
Steve DeNeefe and Kevin Knight. 2009. Synchronous
Tree Adjoining Machine Translation. In Proc. of
EMNLP, page 727.
Thomas S Ferguson. 1973. A ... the Jeopardy Model ? A Quasi-
Synchronous Grammar for QA. In Proc. of EMNLP-
CoNLL, pages 22–32.
Elif Yamangil and Stuart M Shieber. 2010. Bayesian
Synchronous Tree- Substitution Grammar Induction
and...
- 9
- 411
- 0
Tài liệu Báo cáo khoa học: "Machine Translation Using Probabilistic Synchronous Dependency Insertion Grammars" pptx
Ngày tải lên :
20/02/2014, 15:20
... Execute the synchronous tree partitioning opera-
tion on all the “chosen” word pairs on the tree pair.
Hence, several new tree pairs are created. Replace the
old tree pair with the new tree pairs ... on a prob-
abilistic synchronous dependency
insertion grammar. Synchronous depend-
ency insertion grammars are a version of
synchronous grammars defined on de-
pendency trees. We first introduce ... stochastic tree transducers
and some versions of synchronous grammars pro-
vide solutions for the non-isomorphic tree based
transduction problem and hence possible solutions
for MT. Synchronous Tree...
- 8
- 362
- 0