SOTAVerified

Word Translation Without Parallel Data

2017-10-11ICLR 2018Code Available0· sign in to hype

Alexis Conneau, Guillaume Lample, Marc'Aurelio Ranzato, Ludovic Denoyer, Hervé Jégou

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

State-of-the-art methods for learning cross-lingual word embeddings have relied on bilingual dictionaries or parallel corpora. Recent studies showed that the need for parallel data supervision can be alleviated with character-level information. While these methods showed encouraging results, they are not on par with their supervised counterparts and are limited to pairs of languages sharing a common alphabet. In this work, we show that we can build a bilingual dictionary between two languages without using any parallel corpora, by aligning monolingual word embedding spaces in an unsupervised way. Without using any character information, our model even outperforms existing supervised methods on cross-lingual tasks for some language pairs. Our experiments demonstrate that our method works very well also for distant language pairs, like English-Russian or English-Chinese. We finally describe experiments on the English-Esperanto low-resource language pair, on which there only exists a limited amount of parallel data, to show the potential impact of our method in fully unsupervised machine translation. Our code, embeddings and dictionaries are publicly available.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
en-esAdv - Refine - CSLSP@181.7Unverified
en-frAdv - Refine - CSLSP@182.3Unverified
es-enAdv - Refine - CSLSP@183.3Unverified
fr-enAdv - Refine - CSLSP@182.1Unverified

Reproductions