Hypergraphs

Word graphs are able to represent a large num- ber of different utterance hypotheses in a very compact manner. However, usually they con- tain a huge amount of redundancy in …...

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 …...

Machine translation benefits from system combination. We propose flexible interaction of hypergraphs as a novel technique combin- ing different translation models within one de- coder. We introduce features controlling the …...