| Word Alignment as a Hypergraph | In this work, we parse our English data, and for each sentence E = e’f, let T be its syntactic parse . |
| Word Alignment as a Hypergraph | (1) that using the structure of l-best English syntactic parse trees is a reasonable way to frame and drive our search, and (2) that F-measure approximately decomposes over hyperedges. |
| Word Alignment as a Hypergraph | Initial alignments We can construct a word alignment hierarchically, bottom-up, by making use of the structure inherent in syntactic parse trees. |