The first is a method that finds translation pairs in parallel corpora (Wu and Xia, 1994;Fung and Church, 1994;Och and Ney, 2003).
in summary, our proposed method consists of three steps (see Algorithm 1): (1) graph construc-Algorithm 1 Bilingual Lexicon Extraction Require: comparable corpora D e and D f , a seed lexicon S consists of S e and S f Ensure: Output translation pairs T 1-1: G e = {E e , V e , W e } ← construct-graph(D e ) 1-2: e , W e , Q e } ← propagate-seed (G e , S e ) 2-2: tion for each language, (2) seed propagation in each graph, (3) translation pair extraction.