Báo cáo khoa học: "Generation as Dependency Parsing" potx
Tài liệu Báo cáo khoa học: "Non-Projective Dependency Parsing in Expected Linear Time" pptx
... trained
parsers deviate from the ideal case.
The result for Arabic and Danish can be seen
356
Arabic Czech Danish Slovene Turkish
System AS EM AS EM AS EM AS EM AS EM
S
u
67.1 (9.1) 11.6 82.4 (73.8) ... Σ).
Hence, the complexity of deterministic parsing is
O(n) in the worst case (as well as in the best case).
3.2 Unrestricted Dependency Parsing
We now consider what happens when...
Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf
... be integrated into a phrase-based
decoder to compute dependency language model
scores. Our results show that augmenting a state-of-
the-art phrase-based system with this dependency
language model ... Arabic-English
tasks incorporate synchronous CFG models, score differ-
ences with the best phrase-based system were insignificantly
small.
773
dency structure is built as a by-product of phr...
Tài liệu Báo cáo khoa học: "Pseudo-Projective Dependency Parsing" doc
... the finite-state
dependency parser for Turkish by Oflazer (2003).
This is in contrast to dependency treebanks, e.g.
Prague Dependency Treebank (Haji
ˇ
c et al., 2001b),
Danish Dependency Treebank ... Transformations
We assume that the goal in dependency parsing is to
construct a labeled dependency graph of the kind de-
picted in Figure 1. Formally, we define dependency
graphs as...
Tài liệu Báo cáo khoa học: "Humor as Circuits in Semantic Networks" doc
... humor generation.
While humor/sarcasm recognition merits direct ap-
plication to the areas such as information retrieval
(Friedland and Allan, 2008), sentiment classifica-
tion (Mihalcea and Strapparava, ... circuits are learned in a su-
pervised way, where binary labels assign each can-
didate circuit one of the two classes {feasible,
infeasible} (we used 8 seed concepts, with 300
generated...
Tài liệu Báo cáo khoa học: "Lemmatisation as a Tagging Task" pdf
... devel-
oped. Our approach is based on redefining the task
of lemmatisation as a category tagging task. Formu-
lating lemmatisation as a tagging task allows the use
of advanced tagging techniques, ... of the Association for Computational Linguistics, pages 368–372,
Jeju, Republic of Korea, 8-14 July 2012.
c
2012 Association for Computational Linguistics
Lemmatisation as a Tagging Task
An...
Tài liệu Báo cáo khoa học: "Accurate Context-Free Parsing with Combinatory Categorial Grammar" pptx
... selecting some subset of the classes. In
addition to the schema classes, we also define two
restriction classes which define ways in which the
rule schemata from the schema classes can be re-
stricted. ... any category in the
derivation. The base case is the assignment of a
lexical category to a word and the inductive step is
the use of a rule from schema classes (1-4), (6-7)
and (10-11).
Given...
Tài liệu Báo cáo khoa học: "Wikipedia as Sense Inventory to Improve Diversity in Web Search Results" doc
... that documents about
the Oasis band and the Oasis fashion store deal
with unrelated topics, but it may as well detect
a group of documents discussing why one of the
Oasis band members is leaving ... word sense, measured
as incoming links for the URL of a given
sense in Wikipedia.
• External relevance of a word sense, measured
as the number of visits for the URL of a given
sense (as rep...
Tài liệu Báo cáo khoa học: "WSD as a Distributed Constraint Optimization Problem" pptx
... sense. The word cancer has at least two
senses, one corresponding to the astrological sign
and the other a disease. But its derived form can-
cerous can only be used in disease sense. When
the words ... sense.
Given a word and its possible senses, as defined
by a dictionary, the problem of Word Sense Dis-
ambiguation (WSD) can be defined as the task of
assigning the most appropriate sense t...
Tài liệu Báo cáo khoa học: "Shift-Reduce CCG Parsing" docx
... and combining graph-based
and transition-based dependency parsing using beam-
search. In Proceedings of EMNLP-08, Hawaii, USA.
Yue Zhang and Stephen Clark. 2009. Transition-based
parsing of the ... we assume that each input
word has been assigned a POS-tag (from the Penn
Treebank tagset) and a set of CCG lexical categories.
We use the same maximum entropy POS-tagger and
supertagger as the...
Tài liệu Báo cáo khoa học: "Fast Unsupervised Incremental Parsing" pdf
... in the dependency structure no
such links exist. This property, which I will refer to
as adjacency plays an important role in incremental
parsing, as explained in the next section.
The last main ... are given as weights assigned to labels and
linking properties. Each adjacency point describes a
different link based at x, similar to the specification
of the arguments of a word in depen...