In particular, we propose a novel approach of abstracting entity translation as a graph matching problem of two graphs G e and G c in Figures 1(a) and (b).
the similarity between two nodes v e and v c in G e and G c is initialized as their transliteration similarity, which is iteratively refined based on relational similarity obtained from monolingual cooccurrences.