Non-Adversarial Unsupervised Word Translation

Yedid Hoshen, Lior Wolf
1/18/2018
cs.LGcs.CL

Official code: facebookresearch/MUSE (3,269 stars, last commit 2022-08-31).

Abstract

Unsupervised word translation from non-parallel inter-lingual corpora has attracted much research interest. Very recently, neural network methods trained with adversarial loss functions achieved high accuracy on this task. Despite the impressive success of the recent techniques, they suffer from the typical drawbacks of generative adversarial models: sensitivity to hyper-parameters, long training time and lack of interpretability. In this paper, we make the observation that two sufficiently similar distributions can be aligned correctly with iterative matching methods. We present a novel method that first aligns the second moment of the word distributions of the two languages and then iteratively refines the alignment. Extensive experiments on word translation of European and Non-European languages show that our method achieves better performance than recent state-of-the-art deep adversarial approaches and is competitive with the supervised baseline. It is also efficient, easy to parallelize on CPU and interpretable.

View on arXivView PDF

Code Implementations(1)

A library for Multilingual Unsupervised or Supervised word Embeddings

3,269571Shell, PythonOct 23, 20174 years agoNOASSERTION

Similar Papers

Cite this paper

@article{hoshen2018nonadversarial,
  title  = {Non-Adversarial Unsupervised Word Translation},
  author = {Yedid Hoshen and Lior Wolf},
  year   = {2018},
  eprint = {1801.06126},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1801.06126}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1801.06126.svg)](https://codeofpaper.com/paper/1801.06126)

Discussion