By following PEAK, we find the optimal alignment by solving the Linear Assignment Problem.
we compute all similarity scores between EDUs in the summary and pyramid and then find the maximal score so that each EDU in the system summary is matched to at most one EDU in the pyramid.