Tricks from combinatorial optimization make it possible to maximize over all bipartite matchings in polynomial time.
we fall back on the Viterbi approximation for the E-step (Brown et al., 1993;Samdani et al., 2012).