In this case, instead of introducing the relatedness between nonidentical terms, it will also introduce noise.
we also consider an alignment mechanism that we implement greedily via a maximum matching mechanism: (3) We choose j as argmax j φ(a i , b j ) and substitute the similarity φ(a i , b j ) between terms a i and b j into the final similarity between x and y.