Báo cáo khoa học: "Clause Restructuring For SMT Not Absolutely Helpful" ppt
Báo cáo khoa học: "Clause Restructuring For SMT Not Absolutely Helpful" ppt
... Association for Computational Linguistics:shortpapers, pages 384–388,
Portland, Oregon, June 19-24, 2011.
c
2011 Association for Computational Linguistics
Clause Restructuring For SMT Not Absolutely ... recall for the parsers mentioned in
§3. The numbers are collated for reference only and are
not directly comparable; see the text for details.
3 Parser Performance
We fir...
Tài liệu Báo cáo khoa học: "Clause Restructuring for Statistical Machine Translation" ppt
... describe an approach for the use
of syntactic information within phrase-based SMT
systems. The approach constitutes a simple, direct
method for the incorporation of syntactic informa-
tion in a phrase–based ... 2005.
c
2005 Association for Computational Linguistics
Clause Restructuring for Statistical Machine Translation
Michael Collins
MIT CSAIL
mcollins@csail.mit.edu
Philipp Ko...
Tài liệu Báo cáo khoa học: "Topic Models for Dynamic Translation Model Adaptation" pptx
... adaptation is also prevalent but is not the
focus of this work.
115
data come from; and even if we do, “subcorpus” may
not be the most useful notion of domain for better
translations.
We take a ... unseen for a given domain s, we are already
performing an implicit form of smoothing (when
computing the expected counts), since each docu-
ment has a distribution over all topics, and ther...
Tài liệu Báo cáo khoa học: "Guided Learning for Bidirectional Sequence Classification" ppt
... of NN for book. Then we maintain the
top two hypotheses for span book interesting as
shown below. The second most favorable label for
interesting is still JJ, but in the context of VB for
book.
NN ... ).
Therefore, for each span p, we have a top hypothe-
sis p.S.T , whose score is the highest among all the
hypotheses for span p.
Hypotheses are started and grown by means of
labelin...
Báo cáo khoa học: "Parametric Types for Typed Attribute-Value Logic" pptx
... because N may
not have exactly the same structure of informa-
tion states; but an implementor of a feature-
based NLP system, for example, could secretly
perform all of the work for those grammars ...
b(e,e)
subsumes types
d(e,Y,e),
for any type Y, for example
d(e,c(e,e),e),
or
d(e,b(_L,e),e),
but not
d(c(_L,e),e,e),
since
eElc(_l_, e).
Also, for any types, W, X, a...
Báo cáo khoa học: "Spectral Learning for Non-Deterministic Dependency Parsing" ppt
... will not be distributions in the
formal sense. However, they correspond to a projection of a
state distribution, for some projection that we do not recover
from data (namely M
−1
in footnote ... algorithm can be formulated as
a technique for inducing hidden structure
from distributions computed by forward-
backward recursions. Furthermore, we
also present an inside-outside algorithm...
Báo cáo khoa học: "Dynamic Programming for Linear-Time Incremental Parsing" pptx
... grammar
refinement by annotation (Johnson, 1998), where
annotations must be bounded and monotonic: for
example, one cannot refine a grammar by only
remembering the grandparent but not the parent
symbol. ... 02-21 for training, 22
for development, and 23 for testing. Both DP and
non-DP parsers use the same feature templates in
Table 1. For Secs. 4.1-4.2, we use a baseline model
train...
Báo cáo khoa học: "Automated planning for situated natural language generation" pptx
... en-
try for “pushes” furthermore uses subj and obj for
the subject and object argument, respectively. We
combine here for simplicity the entries for “the”
and “button” into “the button”.
For generation, ... adjec-
tives denoting spatial relations (“left”) to one class
and adjectives denoting color (“red”) to another;
then we require that spatial adjectives must always
precede color...
Báo cáo khoa học: "Active Learning for Multilingual Statistical Machine Translation∗" ppt
... of the frag-
ment x for which the resulting phrase lengths are
not greater than the maximum length constraint for
phrase extraction in the underlying SMT model.
Since we do not know anything about ... pair,
hence these tasks are competing for annotating the
same resource. However it may be that in a single
language pair, AL would pick a particular sentence
for annotation, but in...
Báo cáo khoa học: "Error Mining for Wide-Coverage Grammar Engineering" ppt
... archaic formulas such
as God zij dank (Thank God). In such examples,
the form zij is the (archaic) subjunctive form of the
Dutch verb zijn (to be). The sequence Het zij zo is
another fixed formula ... second. c
m
contains all sentences
for which parsing was not successful. c
a
contains
all sentences overall. For both corpora, we com-
pute the frequency of all n-grams for all n; n-grams...