Summary: Hierarchical Phrase-Based Translation Representations
Gonzalo Iglesias Cyril Allauzen
William Byrne
Adri`a de Gispert Michael Riley
Department of Engineering, University of Cambridge, Cambridge, CB2 1PZ, U.K.
{gi212,wjb31,ad465}@eng.cam.ac.uk

Google Research, 76 Ninth Avenue, New York, NY 10011
{allauzen,riley}@google.com
Abstract
This paper compares several translation rep-
resentations for a synchronous context-free
grammar parse including CFGs/hypergraphs,
finite-state automata (FSA), and pushdown
automata (PDA). The representation choice is
shown to determine the form and complex-
ity of target LM intersection and shortest-path
algorithms that follow. Intersection, shortest
path, FSA expansion and RTN replacement al-
gorithms are presented for PDAs. Chinese-to-

Source: Allauzen, Cyril - Computer Science Department, Courant Institute of Mathematical Sciences, New York University
Pregibon, Daryl - Google Labs

Collections: Computer Technologies and Information Sciences; Mathematics