In addition to calculating the distance between the two relation vectors, we believe that the more aligned entities exist in the entities that are connected to the two relations, the more likely the two relations are equivalent.
for r 1 and r 2 , we collect the pre-aligned entities existing in the head/tail entities of these two relations as the set P r 1 r 2 = {(e i 1 , e i 2 )|e i 1 ∈ HT r 1 , e i 2 ∈ HT r 2 , (e i 1 , e i 2 ) ∈ L}.