This paper presents a graph-theoretic approach to the identification of yetunknown word translations. The proposed algorithm is based on the recursive SimRank algorithm and relies on the intuition that two words are similar if they establish similar grammatical relationships with similar other words. We also present a formulation of SimRank in matrix form and extensions for edge weights, edge labels and multiple graphs.
REF and extend SimRank to edge weights, edge labels and multiple graphs.
A Graph-Theoretic Algorithm for Automatic Extension of Translation Lexicons
Proceedings of the Workshop on Geometrical Models of Natural Language Semantics
Mathematics