Báo cáo khoa học: "Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy" potx
Báo cáo khoa học: "Encoding Lexicalized Tree Adjoining Grammars with a Nonmonotonic Inheritance Hierarchy" potx
...
the tree nodes are labeled with syntactic categories
and feature information and there is at least one
leaf node labeled with a lexical category (such lexi-
cal leaf nodes are known as anchors). ... lexical entries are actually associa-
ted with tree families, and that these group to-
gether trees that are related to each other. Thus in
the same family as a standard ditra...
Báo cáo khoa học: "Extraction of Tree Adjoining Grammars from a Treebank for Korean" pdf
... this paper we implement a system
which extracts a Lexicalized Tree Adjoining
Grammar and a Feature-based Lexicalized Tree
Adjoining Grammar from Korean Sejong Treebank
(SJTree). SJTree contains ... been taken during last decades.
Automatic grammar development means that a
system extracts a grammar from a Treebank which
has an implicit Treebank grammar. The gramma...
Báo cáo khoa học: "Unifying Synchronous Tree-Adjoining Grammars and Tree Transducers via Bimorphisms" pptx
... generically.
2 Tree- Adjoining Grammars
Tree adjoining grammar (TAG) is a tree gram-
mar formalism distinguished by its use of a tree
adjunction operation. Traditional presentations
of TAG, which ... brevity
and by analogy with embedded pushdown au-
tomata (Schabes and Vijay-Shanker, 1990), an-
other automata-theoretic characterization of the
tree- adjoining languages.
W...
Báo cáo khoa học: "LICENSING AND TREE ADJOINING GRAMMAR IN GOVERNMENT BINDING PARSING" pdf
... parser is constrained
to the domain determined by a Tree Adjoining Grammar
elementary tree. All dependencies and constraints are lo-
caiized within this bounded structure. The resultant parser ... GB, as a com-
petence theory, emphatically does not specify the nature
of the language processing mechanism. In fact, "proofs"
that transformational grammar is inadequate as...
Báo cáo khoa học: "Restrictions on Tree Adjoining Languages" pptx
... Pennsylvania
Philadelphia, PA 19103
schuler@linc, cis. upenn, edu
Abstract
Several methods are known for parsing lan-
guages generated by Tree Adjoining Grammars
(TAGs) in O(n 6) worst case ... first,
that elementary trees are binary (no more than
two children at each node) and no leaf node is
labeled by e; and second, that there is always
a wrapping node in each wrapping tr...
Báo cáo khoa học: "Modeling Human Sentence Processing Data with a Statistical Parts-of-Speech Tagger" ppt
... staff. (Object-relative)
The reading time advantage of subject-relative
clauses over object-relative clauses is robust in En-
glish (Traxler et al., 2002) as well as other lan-
guages (Mak et al., ... tagger initially favors
the main-verb interpretation for the ambiguous -ed
form, and later it makes a repair when the ambigu-
ity is resolved as a past-participle.
The RR ambiguity is often...
Báo cáo khoa học: "Historical Analysis of Legal Opinions with a Sparse Mixed-Effects Latent Variable Model" potx
... might
because that SVM, as a strong large margin learner,
is a more natural approach in a binary classification
setting, but might not be the best choice in a four-
way or multiclass classification task.
5.1.2 ... (Eisenstein et al., 201 1a) , a recently pro-
posed sparse additive generative model of language,
addresses many of the drawbacks of LDA. SAGE
assumes a background distrib...
Báo cáo khoa học: "Pattern Learning for Relation Extraction with a Hierarchical Topic Model" pptx
... general patterns that appear
for all relations. φ
D
captures patterns that are spe-
cific about a certain entity pair, but which are not
generalizable across all pairs with the same relation.
Finally ... that are expressing
the relation and those that are ambiguous and can be
applied across relations. In this way, high-precision
extraction patterns can be learned without the need
of any ma...
Báo cáo khoa học: "Parsing the Wall Street Journal with the Inside-Outside Algorithm" potx
... Reducing the Grammar Size and
Smoothing Issues
As grammars are being inferred at each iteration, the
training algorithm was designed to guarantee that no
parameter was set below some small threshold. ... Natural Language Work-
shop,
pages 3(i)6-311, Pacific Grove, California.
Morgan Kaufinann.
Ezra Black, John L;dferty, and Salim Roukos. 1992.
Development and Evaluation of a Broa...
Tài liệu Báo cáo khoa học: "Fine-grained Tree-to-String Translation Rule Extraction" docx
... COLING-ACL, pages 961–968, Sydney.
Hany Hassan, Khalil Sima’an, and Andy Way. 2007.
Supertagged phrase-based statistical machine trans-
lation. In Proceedings of ACL, pages 288–295, June.
Liang Huang ... fragment “VBN(killed)” ap-
pears 6 times with “koroshita”, which is a
Japanese translation of an active form of “killed”,
and 4 times with “korosareta”, which is a
Japanese translatio...