We introduce the Machine Translation (MT) evaluation survey that contains both manual and
automatic evaluation methods. The traditional human evaluation criteria mainly include the …

Synchronous context-free grammars are a generalization of context-free grammars (CFGs)
that generate pairs of related strings instead of single strings. Thus they are useful in many …

This paper introduces the state-of-the-art machine translation (MT) evaluation survey that
contains both manual and automatic evaluation methods. The traditional human evaluation …

Abstract Factoring a Synchronous Context-Free Grammar into an equivalent grammar with a
smaller number of nonterminals in each rule enables synchronous parsing algorithms of …

Automatically evaluating word order of MT system output at the sentence-level is
challenging. At the sentence-level, ngram counts are rather sparse which makes it difficult to …

In this second part of the survey, we present the application of weighted extended top-down
tree transducers in machine translation, which is the automatic translation of natural …

This thesis addresses the design of appropriate formalisms and algorithms to be used for
natural language processing. This entails a delicate balance between the ability of a …

Synchronous Tree-Adjoining Grammar (STAG) is a promising formalism for syntax-aware
machine translation and simultaneous computation of natural-language syntax and …

Long-range word order differences are a well-known problem for machine translation.
Unlike the standard phrase-based models which work with sequential and local phrase …

Existing approaches for evaluating word order in machine translation work with metrics
computed directly over a permutation of word positions in system output relative to a …