Our work uses the same training criterion and is based on the same generative story.
in case of a one-to-one mapping the problem of assigning translation candidates such that the sum of distances is minimal can be solved optimally in polynomial time using the hungarian algorithm (Kuhn, 1955).