| Challenge: | Autoregressive transformers (ART)-based grapheme-to-phoneme (G2P) models have been proposed for bi/multilingual text-to speech systems. |
| Approach: | They propose a bilingual grapheme-to-phoneme (G2P) model with autoregressive transformers for fast and exact decoding and data augmentation for predicting output length. |
| Outcome: | The proposed model achieves better performance than the previous model and 2700% faster inference speed. |
Similar Papers
Multimodal, Multilingual Grapheme-to-Phoneme Conversion for Low-Resource Languages (D19-61)
Copied to clipboard
| Challenge: | Grapheme-to-phoneme conversion (g2p) is a task of predicting the pronunciation of words from their orthographic representation. |
| Approach: | They propose to leverage audio data as an auxiliary modality in a multi-task training process to learn a more optimal grapheme representation. |
| Outcome: | The proposed model reduces phoneme error rate to 2.46% on in-domain test set compared to unimodal spelling- pronunciation model. |
GE2PE: Persian End-to-End Grapheme-to-Phoneme Conversion (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing text-to-speech systems struggle to produce natural speech from grapheme sequences . Grapheme-to phoneme conversion (G2P) systems face limitations when dealing with Persian texts due to the complexity of Persian transcription. |
| Approach: | They propose to use phonetic information to enhance the input sequence for Persian translations. |
| Outcome: | The proposed model surpasses state-of-the-art models by 1.86% in word error rate and 3.42% in homograph disambiguation accuracy. |
Zero-shot Learning for Grapheme to Phoneme Conversion with Language Ensemble (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing work focuses on low-resource and endangered languages with limited training sets. |
| Approach: | They propose a hypothesis set for any unseen target language and combine it with a confusion network to propose 'the most likely hypothesis' they test the approach on over 600 unseened languages and demonstrate it significantly outperforms baselines. |
| Outcome: | The proposed model outperforms baselines on over 600 unseen languages. |
Fast and Accurate Deep Bidirectional Language Representations for Unsupervised Learning (2020.acl-main)
Copied to clipboard
| Challenge: | Existing deep bidirectional language models are limited by repetitive inferences on unsupervised tasks for the computation of contextual language representations. |
| Approach: | They propose a deep bidirectional language model called a Transformer-based Text Autoencoder (T-TA) it computes contextual language representations without repetition and shows competitive or even better accuracies than BERT . |
| Outcome: | The proposed model performs six times faster on a reranking task and twelve times faster in a semantic similarity task. |
Quick Back-Translation for Unsupervised Machine Translation (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Unsupervised machine translation models are limited by the run-time of autoregressive inference during back-translation and lack of synthetic data efficiency. |
| Approach: | They propose a two-for-one improvement to Transformer back-translation: Quick Back-Translation (QBT). QBT re-purposes the encoder as a generative model, and uses encoder-generated sequences to train the decoder. |
| Outcome: | Experiments on various WMT benchmarks show that QBT dramatically outperforms standard back-translation only method in terms of training efficiency for comparable translation qualities. |
Syntactically Supervised Transformers for Faster Neural Machine Translation (P19-1)
Copied to clipboard
| Challenge: | Standard decoders for neural machine translation generate a single token per timestep, which slows inference . a series of controlled experiments demonstrates that SynST decodes sentences 5x faster than the baseline autoregressive Transformer. |
| Approach: | They propose a syntactically supervised Transformer that generates all target tokens in one shot . synST is a variant of the Transformer architecture that autoregressively predicts a chunked parse tree . |
| Outcome: | The proposed method decodes sentences 5x faster than the baseline method on En-De and En-Fr datasets while achieving higher BLEU scores. |
Easy and Efficient Transformer: Scalable Inference Solution For Large NLP Model (2022.naacl-industry)
Copied to clipboard
Gongzheng Li, Yadong Xi, Jingzhen Ding, Duan Wang, Ziyang Luo, Rongsheng Zhang, Bai Liu, Changjie Fan, Xiaoxi Mao, Zeng Zhao
| Challenge: | Recent studies show that transformer-based models are effective over many tasks, but they are expensive to deploy in the industrial application. |
| Approach: | They propose a transformer-based inference solution that optimizes kernels for long inputs and large hidden sizes and a flexible CUDA memory manager to reduce the memory footprint when deploying a large model. |
| Outcome: | The proposed solution achieves an average speedup of 1.40-4.20x on the transformer decoder layer with an A100 GPU. |
End-to-End Multilingual Automatic Dubbing via Duration-based Translation with Large Language Models (2025.emnlp-demos)
Copied to clipboard
| Challenge: | Automatic dubbing (AD) aims to replace the original speech with translated speech that maintains precise temporal alignment (isochrony). |
| Approach: | They propose an end-to-end automatic dubbing framework that leverages large language models to integrate translation and timing control seamlessly. |
| Outcome: | The proposed framework achieves up to 24% relative gains on English, Spanish, and Korean language pairs while maintaining competitive translation quality measured by COMET scores. |
End-to-end ASR to jointly predict transcriptions and linguistic annotations (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing models generate audio transcripts by sequentially producing likely graphemes, or multi-graphemic units, from which lexical items of a language can be recovered. |
| Approach: | They propose a Transformer-based sequence-to-sequence model for automatic speech recognition that can produce high-quality transcriptions and linguistic annotations. |
| Outcome: | The proposed model can produce high-quality transcriptions and linguistic annotations on Japanese and English audio datasets. |
mLongT5: A Multilingual and Efficient Text-To-Text Transformer for Longer Sequences (2023.findings-emnlp)
Copied to clipboard
| Challenge: | a new text-to-text transformer is suitable for multilingual inputs . many of the current models are English-only, making them inapplicable to other languages. |
| Approach: | They propose to extend a multilingual text-to-text transformer to handle long inputs . they use the mC4 dataset to pretrain the model to handle multilingual data . |
| Outcome: | The proposed model performs well on multilingual summarization and question-answering tasks. |