Similar to <cite>Conneau et al. (2018)</cite> ), we finetune our initial mappings (G and F ) by iteratively solving the Procrustes problem and applying a dictionary induction step. <cite>This method</cite> uses singular value decomposition or SVD of Z T y Z x to find the optimal mappings G (similarly SVD(Z T x Z y ) for F ) given the approximate alignment of words from the previous step.