However, since a hypergraph is constructed from an nbest list, it can only represent partial space of all alignments (p(A|H) < 1) because of the limiting size of hyperedges learned from the list.
we need to enumerate all possible alignments in a hypergraph to obtain the probability sum p(A|H).