AAS and MAS deal with many-to-many and oneto-many word alignments, respectively.
given H identified using the Hungarian algorithm (Kuhn, 1955), HAS is computed by averaging the similarities between embeddings of the aligned pairs of words.