Báo cáo khoa học: "Tackling Sparse Data Issue in Machine Translation Evaluation ∗" pptx
Báo cáo khoa học: "Tackling Sparse Data Issue in Machine Translation Evaluation ∗" pptx
... Proceedings of the ACL 2010 Conference Short Papers, pages 86–91,
Uppsala, Sweden, 11-16 July 2010.
c
2010 Association for Computational Linguistics
Tackling Sparse Data Issue in Machine Translation ... statistical machine translation. In Pro-
ceedings of the Fourth Workshop on Statistical Ma-
chine Translation, Athens, Greece. Association for
Computational Linguistics.
Sil...
Báo cáo khoa học: "Prediction of Learning Curves in Machine Translation" ppt
... methods for predicting learning curves in
both these scenarios.
1 Introduction
Parallel data in the domain of interest is the key re-
source when training a statistical machine transla-
tion (SMT) ... set of training datasets, T
c
is the
set of test datasets for training configuration c,
ˆ
θ is as defined in Eq. 2, N is the total number
of combinations of training configurations and
te...
Báo cáo khoa học: "XML-Based Data Preparation for Robust Deep Parsing" pptx
... does not need
to contain special rules for ‘multi-word’ words:
W P= IN In order to /W In order to IN
W P= IN in relation to /W in relation to IN
W P=’JJ’ in vitro /W in vitro JJ
The same technique ... cov-
ering node are inherited from the word, not the
tag. This method of combining POS tag infor-
mation with lexical entries preserves all informa-
tion in the lexical entries...
Tài liệu Báo cáo khoa học: "Bilingual Sense Similarity for Statistical Machine Translation" ppt
... Trigger-Based Lexicon Models. In: Pro-
ceedings of EMNLP, Singapore.
F. Och. 2003. Minimum error rate training in statistic-
al machine translation. In: Proceedings of ACL.
Sapporo, Japan.
S. Pado ... sta-
tistical machine translation. In Proceedings of
EMNLP, pp. 206–213. July. Barcelona, Spain.
843
Proceedings of the 48th Annual Meeting of the Association for Computationa...
Tài liệu Báo cáo khoa học: "Non-Projective Dependency Parsing in Expected Linear Time" pptx
... quadratic in the worst case but still linear
in the best case. In Section 4, we present experi-
ments indicating that the expected running time of
the new system on naturally occurring data is in
fact ... words in the input. Adding
the swapping operation changes the time
complexity for deterministic parsing from
linear to quadratic in the worst case, but
empirical estimates base...
Tài liệu Báo cáo khoa học: "Quadratic-Time Dependency Parsing for Machine Translation" pdf
... changes during de-
coding (and thus lessening the need for syntactic
decoding) by rearranging input words in the train-
ing data to match the syntactic structure of the
target language. Finally, ... implemented
in (Stolcke, 2002), and we only kept 4-grams and
5-grams that occurred at least three times in the
training data.
6
For tuning and testing, we use the official NIST
MT evalua...
Tài liệu Báo cáo khoa học: "Re-Usable Tools for Precision Machine Translation∗" pdf
... aims at building an exper-
imental machine translation system from Norwe-
gian to English of texts in the domain of hiking in
the wilderness (Oepen et al., 2004). It is funded
within the Norwegian ... assembles
independently valuable general-purpose
NLP components into a machine trans-
lation pipeline that capitalizes on output
quality. The demonstrator embodies an in-
teresting c...
Tài liệu Báo cáo khoa học: "Minimal Recursion Semantics as Dominance Constraints: Translation, Evaluation, and Analysis" pptx
... symbols.
4. The binary predicate symbol ‘=
q
’.
MRS constraints have three kinds of literals, two
kinds of elementary predications (EPs) in the first
two lines and handle constraints in the third line:
1. ... dominance edges are plotted in Fig. 9.
Inputs are grouped according to the constraint size.
The filled circles indicate average runtimes within
each size group for enumerating all so...
Tài liệu Báo cáo khoa học: "Constraints over Lambda-Structures in Semantic Under specification" pptx
... (Niehren and Koller, 1998) if
binding and linking relations in A-structures are
ignored.
For the interaction of binding with parallelism
we follow the basic idea that binding relations
should be ... variable-capturing when instan-
tiating underspecified scope representations. In
principle, capturing may occur in all formalisms
for structural underspecification which repre-
sent...
Tài liệu Báo cáo khoa học: "Phrase-Based Backoff Models for Machine Translation of Highly Inflected Languages" docx
... combining in- domain and
42
out-of-domain data for the purpose of bootstrap-
ping a part-of-speech tagger for Chinese, outper-
forming standard methods such as EM.
4 Backoff Models in MT
In order ... when training data is limited or from
a different domain. Many current and future ap-
plications of machine translation require the rapid
porting of existing systems to new languages...