As opposed to the search problem, we propose a graph-based compact representation that encodes multiple alignments for machine translation.
2 When extracting rules from hypergraphs, we set the pruning threshold t = 0.5.