We propose an iterative matching and translation algorithm composed of the following three steps: ( Step 1) Matching In iteration t = 0, we construct a large pseudo-parallel corpusX andŶ (0) by pairing sentences from X with those from Y .
we calculate the semantic cosine similarity score (detailed in Section 4.4) between a sentence x i ∈ X and every sentence y ∈ Y , select the one with the highest score asŷ i , and only keep the sentence pair if the similarity exceeds a threshold γ.X denotes the subset of the original corpus X for which we find matches.