mlsanityData to 14 Oct 2026

Scaling Back-Translation with Domain Text Generation for Sign Language Gloss Translation

arXiv 2210.07054 ↗First posted 13 Oct 2022cs.CL cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

Sign language gloss translation aims to translate the sign glosses into spoken language texts, which is challenging due to the scarcity of labeled gloss-text parallel data. Back translation (BT), which generates pseudo-parallel data by translating in-domain spoken language texts into sign glosses, has been applied to alleviate the data scarcity problem. However, the lack of large-scale high-quality domain spoken language text data limits the effect of BT. In this paper, to overcome the limitation, we propose a Prompt based domain text Generation (PGEN) approach to produce the large-scale in-domain spoken language text data. Specifically, PGEN randomly concatenates sentences from the original in-domain spoken language text data as prompts to induce a pre-trained language model (i.e., GPT-2) to generate spoken language texts in a similar style. Experimental results on three benchmarks of sign language gloss translation in varied languages demonstrate that BT with spoken language texts generated by PGEN significantly outperforms the compared methods. In addition, as the scale of spoken language texts generated by PGEN increases, the BT technique can achieve further improvements, demonstrating the effectiveness of our approach. We release the code and data for facilitating future research in this field.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 24 of its 48 references that are in the map. First posted on arXiv 13 Oct 2022.

Builds on

24 of 48 references.

References · 24

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2021Pre-train, Prompt, and Predict: A Systematic Survey of Prompting Methods in Natural Language Processingcited by 2,234
  3. 2020Extracting Training Data from Large Language Modelscited by 2,189
  4. 2020mT5: A massively multilingual pre-trained text-to-text transformercited by 1,818
  5. 2015Improving Neural Machine Translation Models with Monolingual Datacited by 788
  6. 2020Pre-trained Models for Natural Language Processing: A Surveycited by 505
  7. 2018Texygen: A Benchmarking Platform for Text Generation Modelscited by 491
  8. 2019How to Fine-Tune BERT for Text Classification?cited by 411
  9. 2020Sign Language Transformers: Joint End-to-end Sign Language Recognition and Translationcited by 256
  10. 2021Improving Sign Language Translation with Monolingual Data by Sign Back-Translationcited by 179
  11. 2020Data Augmentation using Pre-trained Transformer Modelscited by 168
  12. 2019Sign Language Recognition, Generation, and Translation: An Interdisciplinary Perspectivecited by 87
12 more
  1. 2021Medically Aware GPT-3 as a Data Generator for Medical Dialogue Summarizationcited by 76
  2. 2020TSPNet: Hierarchical Feature Learning via Temporal Semantic Pyramid for Sign Language Translationcited by 75
  3. 2020Spatial-Temporal Multi-Cue Network for Continuous Sign Language Recognitioncited by 74
  4. 2018SwitchOut: an Efficient Data Augmentation Algorithm for Neural Machine Translationcited by 72
  5. 2020Multi-channel Transformers for Multi-articulatory Sign Language Translationcited by 71
  6. 2021Including Signed Languages in Natural Language Processingcited by 68
  7. 2021Data Augmentation for Sign Language Gloss Translationcited by 28
  8. 2021Sign Language Translation with Hierarchical Spatio-TemporalGraph Neural Networkcited by 26
  9. 2022Machine Translation from Signed to Spoken Languages: State of the Art and Challengescited by 20
  10. 2018Back-Translation Sampling by Targeting Difficult Words in Neural Machine Translationcited by 19
  11. 2020Data Rejuvenation: Exploiting Inactive Training Examples for Neural Machine Translationcited by 17
  12. 2021Self-Training Sampling with Monolingual Data Uncertainty for Neural Machine Translationcited by 17

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 3.

4 papers.