Textless Speech-to-Speech Translation With Limited Parallel Data

Anuj Diwan, Anirudh Srinivasan, David Harwath, Eunsol Choi
5/24/2023
cs.CLeess.AS

No official code found. Best implementation: ajd12342/textless-s2st (10 stars, MIT, last commit 2024-10-14).

Abstract

Existing speech-to-speech translation (S2ST) models fall into two camps: they either leverage text as an intermediate step or require hundreds of hours of parallel speech data. Both approaches are incompatible with textless languages or language pairs with limited parallel data. We present PFB, a framework for training textless S2ST models that require just dozens of hours of parallel speech data. We first pretrain a model on large-scale monolingual speech data, finetune it with a small amount of parallel speech data (20-60 hours), and lastly train with an unsupervised backtranslation objective. We train and evaluate our models for English-to-German, German-to-English and Marathi-to-English translation on three different domains (European Parliament, Common Voice, and All India Radio) with single-speaker synthesized speech. Evaluated using the ASR-BLEU metric, our models achieve reasonable performance on all three domains, with some being within 1-2 points of our higher-resourced topline.

View on arXivView PDF

Code Implementations(1)

MIT

Code for 'Textless Speech-to-Speech Translation With Limited Parallel Data'

100May 24, 20232 years agoMIT

Similar Papers

Cite this paper

@article{diwan2023textless,
  title  = {Textless Speech-to-Speech Translation With Limited Parallel Data},
  author = {Anuj Diwan and Anirudh Srinivasan and David Harwath and Eunsol Choi},
  year   = {2023},
  eprint = {2305.15405},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.15405v3}
}

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

Discussion