Hierarchical phrase-based translation with weighted finite-state transducers and shallow-n grammars

  • Authors:

  • Adrià de Gispert;Gonzalo Iglesias;Graeme Blackwood;Eduardo R. Banga;William Byrne

  • Affiliations:

  • University of Cambridge;University of Vigo;University of Cambridge;University of Vigo;University of Cambridge

  • Venue:
  • Computational Linguistics
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this article we describe HiFST, a lattice-based decoder for hierarchical phrase-based translation and alignment. The decoder is implemented with standard Weighted Finite-State Transducer (WFST) operations as an alternative to the well-known cube pruning procedure. We find that the use of WFSTs rather than k-best lists requires less pruning in translation search, resulting in fewer search errors, better parameter optimization, and improved translation performance. The direct generation of translation lattices in the target language can improve subsequent rescoring procedures, yielding further gains when applying long-span language models and Minimum Bayes Risk decoding. We also provide insights as to how to control the size of the search space defined by hierarchical rules. We show that shallow-n grammars, low-level rule catenation, and other search constraints can help to match the power of the translation system to specific language pairs.