bayesian symbolrefined tree substitution grammars for syntactic parsing
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
... 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 model is an extension ... Association for Computational Linguistics, pages 440–448,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Bayesian Symbol-Refined Tree Substitution Grammars
for ... the
accuracy of a TSG parser.
In this paper, we propose Symbol-Refined Tree
Substitution Grammars (SR-TSGs) for syntactic
parsing. SR-TSG is an extension of the conventional
TSG model where each...
- 9
- 411
- 0
Báo cáo khoa học: "Native Language Detection with Tree Substitution Grammars" pptx
Ngày tải lên :
07/03/2014, 18:20
... Compact but Accurate Tree-
Substitution Grammars. In Proceedings NAACL.
Trevor Cohn, and Phil Blunsom 2010. Blocked inference
in Bayesian tree substitution grammars. Association
for Computational ... Unsupervised
Induction of Tree Substitution Grammars for Depen-
dency Parsing. Empirical Methods in Natural Lan-
guage Processing.
Rens Bod 1991. A Computational Model of Language
Performance: Data Oriented Parsing. ... proba-
bilistic context-free grammars. Association for Com-
putational Linguistics.
Sangati, Federico and Zuidema, Willem 2011. Accurate
Parsing with Compact Tree- Substitution Grammars:
Double-DOP....
- 5
- 339
- 0
Tài liệu Báo cáo khoa học: "Towards History-based Grammars: Using Richer Models for Probabilistic Parsing*" docx
Ngày tải lên :
20/02/2014, 21:20
... describe a technique for estimat-
ing the parameters for this model using decision
trees. The history-based grammar model provides
a mechanism for taking advantage of contextual
information from ...
of a parse tree in terms of the leftmost derivation
of the tree.
Following (5), we show in Figure 1 a context-
free grammar (CFG) for
a'~b "~
and the parse tree
for the sentence ...
Figure h Grammar and parse tree for
aabb.
dexed the non-terminal (NT) nodes of the tree
with this leftmost order. We denote by ~- the sen-
tential form obtained just before we expand node
i....
- 7
- 372
- 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
... (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. ...
ments and performs term unification thus generating
all the derivation trees. The "stapler" uses both the
elementary tree assignment information and the de-
pendency information present ... 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...
- 8
- 388
- 0
Tài liệu Báo cáo khoa học: "An expressive formalism for describing tree-based grammars" docx
Ngày tải lên :
22/02/2014, 02:20
... handled
are tree fragments. In the XMG formalism, these
units are put into classes. A class associates a
name with a content. At the syntactic level, a con-
tent is a tree description
2
. The tree descriptions
supported ... content con-
sists of tree description and/or of semantic formu-
las. The XMG formalism furthermore supports the
sharing of identifiers across dimension hence al-
lowing for a straightforward encoding ... produces
a tree description. We still need to solve this de-
scription in order to obtain trees (i.e. the items of
the resulting grammar).
Constraint-based tree description solver The
tree description...
- 4
- 328
- 0
Tài liệu Báo cáo khoa học: "A Tool for Multi-Word Expression Extraction in Modern Greek Using Syntactic Parsing" pdf
Ngày tải lên :
22/02/2014, 02:20
... detailed mor-
phosyntactic and semantic information, namely,
selectional properties, subcategorization informa-
tion, and syntactico-semantic features that are
likely to influence the syntactic analysis.
The ... Greece, 3 April 2009.
c
2009 Association for Computational Linguistics
A Tool for Multi-Word Expression Extraction in Modern Greek
Using Syntactic Parsing
Athina Michou
University of Geneva
Geneva, ... candidate ex-
pression represent base word forms (lemmas) and
they are considered in the canonical order implied
by the given syntactic configuration (e.g., for a
verb-object candidate, the object...
- 4
- 491
- 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
...
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, ... symbol, 1
and A are two finite sets 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 ... Application 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,...
- 6
- 370
- 0
Working with XML - The Java API for Xml Parsing (JAXP) Tutorial
Ngày tải lên :
16/10/2013, 12:15
... Overview
javax.xml.transform
Defines the TransformerFactory and Transformer classes, which you
use to get a object capable of doing transformations. After creating a transformer
object, you invoke its transform() ... with respect to the major Java APIs for XML:
JAXP: Java API for XML Parsing
This API is the subject of the present tutorial. It provides a
common interface for creating and using the standard ... hand, creates a tree of
objects from an XML structure. The resulting tree is much easier
to use, and it can be created from an XML structure without a
compilation step. For more information on...
- 494
- 493
- 0
Tài liệu Báo cáo khoa học: "A Framework for Syntactic Translation" docx
Ngày tải lên :
19/02/2014, 19:20
... well take the form of
a program written in a pseudo code, program-
mable on a general-purpose computer. Earlier
estimates
9
that the amount of storage neces-
sary for syntactic information may ...
notation adopted for syntactic categories, how-
ever, was not elaborate enough to express the
relations of natural languages.
Later, the author
9, 10
proposed a syntactic
method for solving ... S
1
,
which
contains all of the information that is in the
input sentence. The part of the information
that is implicit in the sentence (tense, voice,
and so forth) is made explicit in S
1
....
- 7
- 508
- 1
Tài liệu Báo cáo khoa học: "Temporal Restricted Boltzmann Machines for Dependency Parsing" pdf
Ngày tải lên :
20/02/2014, 04:20
... parse history.
For comparison, we also include the performance
numbers for some state-of-the-art dependency pars-
ing systems. Surdeanu and Manning (2010) com-
pare different parsing models using ... to generate latent representa-
tions of local parsing actions, which can then be
used as features for later decisions.
The TRBM model for dependency parsing could
be extended to a Deep Belief Network ... pages 933–939. Associ-
ation for Computational Linguistics.
J. Henderson, P. Merlo, G. Musillo, and I. Titov. 2008.
A latent variable model of synchronous parsing for
syntactic and semantic dependencies....
- 7
- 414
- 0