Data Augmentation for Machine Translation via Dependency Subtree Swapping

Attila Nagy, Dorina Petra Lakatos, Botond Barta, Patrick Nanys, Judit Ács
7/13/2023
cs.CL

No official code found. Best implementation: attilanagy234/TreeSwap (7 stars, last commit 2023-11-11).

Abstract

We present a generic framework for data augmentation via dependency subtree swapping that is applicable to machine translation. We extract corresponding subtrees from the dependency parse trees of the source and target sentences and swap these across bisentences to create augmented samples. We perform thorough filtering based on graphbased similarities of the dependency trees and additional heuristics to ensure that extracted subtrees correspond to the same meaning. We conduct resource-constrained experiments on 4 language pairs in both directions using the IWSLT text translation datasets and the Hunglish2 corpus. The results demonstrate consistent improvements in BLEU score over our baseline models in 3 out of 4 language pairs. Our code is available on GitHub.

View on arXivView PDF

Code Implementations(1)

Complimentary code for our paper TreeSwap: Data Augmentation for Machine Translation via Dependency Subtree Swapping (RANLP 2023)

72Shell, PythonJan 5, 20212 years ago
data-augmentationneural-machine-translation

Similar Papers

Cite this paper

@article{nagy2023data,
  title  = {Data Augmentation for Machine Translation via Dependency Subtree Swapping},
  author = {Attila Nagy and Dorina Petra Lakatos and Botond Barta and Patrick Nanys and Judit Ács},
  year   = {2023},
  eprint = {2307.07025},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2307.07025v1}
}

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

Discussion