xSIM++: An Improved Proxy to Bitext Mining Performance for Low-Resource Languages

Mingda Chen, Kevin Heffernan, Onur Çelebi, Alex Mourachko, Holger Schwenk
6/22/2023
cs.CL

No official code found. Best implementation: facebookresearch/LASER (3,659 stars, last commit 2024-05-02).

Abstract

We introduce a new proxy score for evaluating bitext mining based on similarity in a multilingual embedding space: xSIM++. In comparison to xSIM, this improved proxy leverages rule-based approaches to extend English sentences in any evaluation set with synthetic, hard-to-distinguish examples which more closely mirror the scenarios we encounter during large-scale mining. We validate this proxy by running a significant number of bitext mining experiments for a set of low-resource languages, and subsequently train NMT systems on the mined data. In comparison to xSIM, we show that xSIM++ is better correlated with the downstream BLEU scores of translation systems trained on mined bitexts, providing a reliable proxy of bitext mining performance without needing to run expensive bitext mining pipelines. xSIM++ also reports performance for different error types, offering more fine-grained feedback for model development.

View on arXivView PDF

Code Implementations(1)

Language-Agnostic SEntence Representations

3,659461Java, ShellJun 20, 20182 years agoNOASSERTION

Similar Papers

Cite this paper

@article{chen2023xsim,
  title  = {xSIM++: An Improved Proxy to Bitext Mining Performance for Low-Resource Languages},
  author = {Mingda Chen and Kevin Heffernan and Onur Çelebi and Alex Mourachko and Holger Schwenk},
  year   = {2023},
  eprint = {2306.12907},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.12907v1}
}

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/2306.12907.svg)](https://codeofpaper.com/paper/2306.12907)

Discussion