In this paper, we model the union of cross-lingual links provided by all editions of Wikipedia as an undirected graph G = (V, E) with edge weights w(e) for e ∈ E. In our experiments, we simply honour each individual link equally by defining w(e) = 2 if there are reciprocal links between the two pages, 1 if there is a single link, and 0 otherwise.
our framework is flexible enough to deal with more advanced weighting schemes, e.g.