Eigenvector similarity Since the nearest neighbor graphs are not isomorphic, even for frequent translation pairs in neighboring languages, we want to quantify the potential for unsupervised <cite>BDI</cite> using a metric that captures varying degrees of graph similarity.