Automatic Evaluation of Machine Translation Quality Using Longest Common Subsequence and Skip-Bigram Statistics

By Chin-Yew Lin, Franz Joseph Och. 2004

927 citations recorded by the source corpus.

In this paper we describe two new objective automatic evaluation methods for machine translation. The first method is based on longest common subsequence between a candidate translation and a set of reference translations. Longest common subsequence takes into account sentence level structure similarity naturally and identifies longest co-occurring in-sequence n-grams automatically. The second method relaxes strict n-gram matching to skip-bigram matching. Skip-bigram is any pair of words in their sentence order. Skip-bigram cooccurrence statistics measure the overlap of skip-bigrams between a candidate translation and a set of reference translations. The empirical results show that both methods correlate with human judgments very well in both adequacy and fluency.

Subfields: Artificial Intelligence, Natural Language Processing, Evaluation & Benchmarks

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

  1. Jianfeng Gao
  2. Mohit Bansal
  3. Luke S. Zettlemoyer
  4. Graham Neubig
  5. Yejin Choi
  6. Kyunghyun Cho
  7. Noah A. Smith
  8. Percy Liang

In Natural Language Processing

  1. Jianfeng Gao
  2. Graham Neubig
  3. Mohit Bansal
  4. Luke S. Zettlemoyer
  5. Yejin Choi
  6. Kyunghyun Cho
  7. Noah A. Smith
  8. Mirella Lapata

In Evaluation & Benchmarks

  1. Jianfeng Gao
  2. Mohit Bansal
  3. Lucia Specia
  4. Elizabeth Clark
  5. Yejin Choi
  6. Philipp Koehn
  7. Graham Neubig
  8. Radu Soricut

Citations in the corpus