Hierarchical Phrase-based Translation with Weighted Finite State Transducers and Shallow-N Grammars

Hierarchical Phrase-based Translation with Weighted Finite State Transducers and Shallow-N Grammars” by A. de Gispert, G. Iglesias, G. Blackwood, E. R. Banga, and and W. Byrne. Computational Linguistics, vol. 36, no. 3, Sep. 2010.

Abstract

In this paper 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 give insight 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.

BibTeX entry:

@article{cslhifst10,
   author = {A. de Gispert and G. Iglesias and G. Blackwood and E. R.
	Banga and and W. Byrne,},
   title = {Hierarchical Phrase-based Translation with Weighted Finite
	State Transducers and Shallow-{N} Grammars},
   journal = {Computational Linguistics},
   volume = {36},
   number = {3},
   pages = {505---533 (29 pages)},
   month = sep,
   year = {2010},
   url = {http://www.aclweb.org/anthology/J/J10/J10-3008.pdf}
}

Back to Bill Byrne publications.