A Polynomial-Time Algorithm for Statistical Machine Translation

Dekai Wu

Published 1996 in Annual Meeting of the Association for Computational Linguistics

ABSTRACT

We introduce a polynomial-time algorithm for statistical machine translation. This algorithm can be used in place of the expensive, slow best-first search strategies in current statistical translation architectures. The approach employs the stochastic bracketing transduction grammar (SBTG) model we recently introduced to replace earlier word alignment channel models, while retaining a bigram language model. The new algorithm in our experience yields major speed improvement with no significant loss of accuracy.

PUBLICATION RECORD

  • Publication year

    1996

  • Venue

    Annual Meeting of the Association for Computational Linguistics

  • Publication date

    1996-06-24

  • 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 179 citing papers · Page 1 of 2