Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx
Tài liệu Báo cáo khoa học: "An Open Source Toolkit for Phrase-based and Syntax-based Machine Translation" docx
...
We present a new open source toolkit for
phrase-based and syntax-based machine
translation. The toolkit supports several
state-of-the-art models developed in
statistical machine translation, ... experiments.
6 Conclusion and Future Work
We have presented a new open- source toolkit for
phrase-based and syntax-based machine translation.
It is implemen...
Tài liệu Báo cáo khoa học: "Modified Distortion Matrices for Phrase-Based Statistical Machine Translation" doc
... Bojar, A. Constantin,
and E. Herbst. 2007. Moses: Open Source Toolkit for
Statistical Machine Translation. In Proceedings of the
45th Annual Meeting of the Association for Computa-
tional Linguistics ... Riezler and John T. Maxwell. 2005. On some
pitfalls in automatic evaluation and significance testing
for MT. In Proceedings of the ACL Workshop on In-
trinsic and Extrins...
Báo cáo khoa học: "An Open Source Toolkit for Tree/Forest-Based Statistical Machine Translation" ppt
... an open source toolkit
for tree and forest-based statistical machine
translation (Liu et al., 2006; Mi et al., 2008;
Mi and Huang, 2008). Akamon implements
all of the algorithms required for ... 2006),
which are formally syntax-based. DG stands for dependency (abbreviated as dep.) grammar. ↓ and ↑denote top-down
and bottom-up traversals of a source tree/forest.
string...
Tài liệu Báo cáo khoa học: "An Entity-Mention Model for Coreference Resolution with Inductive Logic Programming" pdf
... “Mr. Powell”, and therefore refers to a male
person and cannot co-refer with “she”.
The entity-mention model based on Eq. (2) per-
forms coreference resolution at an entity-level. For
simplicity, ... previous two sentences for feature computation.
846
ILP uses logic programming as a uniform repre-
sentation for examples, background knowledge and
hypotheses. Given a set of positive...
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... CS(N),
for each N;
• (N, L) • CS(N),
for each N such that N <~*
l, and each L • Af*;
• N • CS(N),
for each N such that -~(N<~*l);
and
• for each
N, children(N) = MI""Mm
and ... needed for construction of parse trees
(or "derived trees" as they are often called for
TAGs) and the computation of features are al-
most identical to the correspo...
Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx
... natural way, as it
is designed for efficient support for data sharing
and destructive operations on shared heaps by
parallel agents.
4 Application and Performance
Evaluation
This section ... parallel system
for processing Typed Feature Structures (TFSs)
on shared-memory parallel machines. We call
the system Parallel Substrate for TFS (PSTFS}.
PSTFS is designed for parall...
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx
... candidates can be evaluated and compared.
We use features of both the candidate parse and the
ignored parts of the original input sentence. The fea-
tures are designed to be general and, for ... designed to be general and, for the most part,
grammar and domain independent. For each parse, the
heuristic computes a penalty score for each of the fea-
tures. The penalties of...
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
... Peter Gibbins, Inn Johnson, Andrew
Kay and Antonio Sanfilippo at SLE, and our anonymous
reviewers for useful feedback and discussions on the re-
search reported here and on earlier drafts of ... it is well-formed or ill-formed.
• maximal
iff it is well-formed and its parent (if it
has one) is ill-formed. In other words, a maxi-
mal TNCB is a largest well-formed component
o...
Tài liệu Báo cáo khoa học: "An Alignment Algorithm using Belief Propagation and a Structure-Based Distortion Model" pdf
... process for computing the English-side mes-
sages and beliefs (m
e
ij
and b
e
i
) , but the process
must also be done symmetrically for the French-
side messages and beliefs (m
f
ij
and b
f
i
) ... data and
with no possibilities for fine-tuning; therefore the
comparison should be fair.
The comparison show that performance-wise,
the monolink algorithm is between the model 2
and...
Tài liệu Báo cáo khoa học: "Trimming CFG Parse Trees for Sentence Compression Using Machine Learning Approaches" pptx
... proposed for
sentence compression (Witbrock and Mittal, 1999;
Jing and McKeown, 1999; Vandeghinste and Pan,
2004), this paper focuses on Knight and Marcu’s
noisy-channel model (Knight and Marcu, ... a shared-forest
structure (Langkilde, 2000). The forest structure
is represented by an AND- OR tree, and it con-
tains many tree structures. The forest represen-
tation saves memory...