Therefore, we need to enumerate all possible alignments in a hypergraph to obtain the probability sum p(A|H).
generating an alignment from a hypergraph can be modelled as finding a complete hyperedge matching, which is a set of hyperedges without common vertices that matches all vertices.