... Association for Computational Linguistics, pages 834–843,
Uppsala, Sweden, 11-16 July 2010.
c
2010 Association for Computational Linguistics
Bilingual Sense Similarity for Statistical Machine Translation ...
units. Therefore, questions emerge: how good is
the sense similarity computed via VSM for two
units from parallel corpora? Is it useful for multi-
lingual applic...
... Boks 1080 Blindern; 0316 Oslo (Norway)
♠
Center for the Study of Language and Information, Stanford, CA 94305 (USA)
{ jtl@ifi.uio.no| oe@csli.stanford.edu}
Abstract
The LOGON MT demonstrator assembles
independently ... Presentation Sessions, pages 53–56,
Sydney, July 2006.
c
2006 Association for Computational Linguistics
Re-Usable Tools for Precision Machine Translation
∗
Jan Tore Lø...
...
end for
12:
end for
13:
for each hypothesis
do
14:
compute HM decoding features for
15:
add to
16:
end for
17:
for ... BTG-based HM Decoding
1:
for each component model
do
2:
output the search space
for the input
3:
end for
4:
for to
do
5:
for all s...
... three lectures is-
used for estimating the optimal word block length
for representing nodes, the threshold distances for
discarding node edges, the number of uniform
chunks for estimating tf-idf ... minimize the similarity across partitions and
maximize the similarity within partitions. This
formulation also allows us to decompose the ob-
jective into a sum of individual terms, an...
... acquire more over time: we in-
tend for it to generalize and encapsulate best practices,
and serve as a testbed for new practices. Dyna is now be-
ing used for parsing, machine translation, morphological
analysis, ... used for parsing, syntax-based
machine translation, morphological analysis, grammar
induction, and finite-state operations.
It is well known that various parsing algo...
... brackets).
For average size texts (e.g. the Written Ques-
tions), these words account for about 5% of the
total (about 3k words / text). This number varies
according to language similarity. For instance,
on ... provide the basic means for ex-
tracting reliable information from parallel texts.
However, as far as we learned from the above
papers, current methods have repeatedly used
st...
... requierments for the formalism
used. Hence, the indexing technique has a wide
spectrum of applications for testing command
relations in syntactic analysis. Futhermore, this
method can also be used for ... special cases of definitions
1.1 and 1.2 for the property of being a set of
maximal projections.
Before I formulate the general command definition
in a formal way, I will now...
... 33–40,
Prague, Czech Republic, June 2007.
c
2007 Association for Computational Linguistics
Word Sense Disambiguation Improves Statistical Machine Translation
Yee Seng Chan and Hwee Tou Ng
Department ... research presents conflicting evi-
dence on whether word sense disambigua-
tion (WSD) systems can help to improve the
performance of statistical machine transla-
tion (MT) system...
... 1)
for j = 1 to qc(x) do
for i = 1 to k do
h
i
(x) ← hash of event {x, j} under h
i
BF[h
i
(x)] ← 1
end for
end for
end for
return BF
3.1 Log-frequency Bloom filter
The efficiency of our scheme for ... 2007.
c
2007 Association for Computational Linguistics
Randomised Language Modelling for Statistical Machine Translation
David Talbot and Miles Osborne
School of Informatics,...
... Cohesive phrase-Based decoding
for statistical machine translation. In ACL- HLT.
Andrew Finch and Eiichiro Sumita. 2008. Dynamic
model interpolation for statistical machine transla-
tion. In SMT ... trees offer very useful
but imperfect reordering constraints for statis-
tical machine translation. A lot of effort has
been made for soft applications of syntactic
constrai...