Fast Decoding and Optimal Decoding for Machine Translation

Ulrich Germann,Michael E. Jahr,Kevin Knight,D. Marcu,Kenji Yamada

Published 2001 in Annual Meeting of the Association for Computational Linguistics

ABSTRACT

A good decoding algorithm is critical to the success of any statistical machine translation system. The decoder's job is to find the translation that is most likely according to set of previously learned parameters (and a formula for combining them). Since the space of possible translations is extremely large, typical decoding algorithms are only able to examine a portion of it, thus risking to miss good solutions. In this paper, we compare the speed and output quality of a traditional stack-based decoding algorithm with two new decoders: a fast greedy decoder and a slow but optimal decoder that treats decoding as an integer-programming optimization problem.

PUBLICATION RECORD

  • Publication year

    2001

  • Venue

    Annual Meeting of the Association for Computational Linguistics

  • Publication date

    2001-07-06

  • Fields of study

    Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

CITED BY

Showing 1-100 of 277 citing papers · Page 1 of 3