Text encoders in neural text-to-speech (TTS) see only linguistic content, so prosody must be inferred from paired data and synthesised intonation is often flat. Contrastive text-audio pretraining (CLAPSpeech) injects prosodic knowledge by contrasting acoustic realisations of the same phoneme, but it never trains the encoder to tell different phonemes apart, and its interaction with masked language modelling (MLM) is unexplored. We study a curriculum for a speaker-conditioned phoneme-and-subword encoder: MLM, contrastive alignment over batches of different phonemes, and CLAPSpeech-style same-phoneme refinement. On Russian conversational speech, with each variant conditioning an identical Grad-TTS model, MLM followed by mixed-phoneme alignment gives the lowest word error rate (17.6% versus 32.8% for same-phoneme training alone) and the best quality and intonation ratings. Adding same-phoneme refinement improves same-phoneme retrieval yet yields the worst synthesis: embedding-space retrieval does not predict usefulness for generation.
Figures & tables
Figure 1: Prosody-aware text encoder. The BPE and phoneme streams are embedded and encoded separately; the projected speaker embedding is added to the token embeddings and modulates every transformer block through AdaLN-Zero (dashed). BPE states are averaged within each word and repeated for every phoneme of that word, summed with the phoneme states, and passed through a shared encoder to give one embedding per phoneme.
Figure 2: Text–audio similarity matrices of the two batch types (four utterances shown). Subscripts denote occurrences of the same phoneme in different utterances.
Stages
R@1-sim
R@5-sim
R@1-diff
R@5-diff
3 †
0.692
0.903
0.779
0.919
1+3
0.665
0.890
0.766
0.922
2
0.690
0.911
0.933
0.986
1+2
0.746
0.937
0.926
0.983
2+3
0.782
0.946
0.871
0.958
1+2+3
0.770
0.935
0.893
0.974
Table 1: Text–audio retrieval of encoder variants (batch of 1024). -sim: same-phoneme batches (prosodic sensitivity); -diff: mixed-phoneme batches (phoneme discrimination). † CLAPSpeech-style same-phoneme training only. Best in bold, second best underlined.
Encoder retrieval
Listening tests
Predicted quality
Intelligibility, speaker
Stages
R@1-sim
R@1-diff
IntMOS
MOS
UTMOS
NISQA
WER (%)
CER (%)
SIM-o
3 †
0.692
0.779
1.615±0.285
1.605±0.165
1.43
2.28
32.8
20.8
0.798
1+3
0.665
0.766
1.855±0.270
1.755±0.160
1.64
2.49
31.0
15.5
0.838
2
0.690
0.933
1.890±0.280
1.895±0.190
1.65
2.72
29.0
14.2
0.854
1+2
0.746
0.926
2.185±0.255
1.980±0.172
1.62
2.80
17.6
6.7
0.862
2+3
0.782
0.871
2.126±0.278
1.840±0.160
1.66
2.73
23.4
12.3
0.843
Table 2: Grad-TTS conditioned on each encoder variant. R@1 values are repeated from Table 1 to show that retrieval does not predict synthesis. MOS and IntMOS: mean ± 95% confidence interval on the anchored 0–5 scales of Sec. 3 . † CLAPSpeech-style same-phoneme training only. Best in bold, second best underlined.
Figure 3: WER of Grad-TTS against the retrieval accuracy of the encoder that conditions it; labels give the stages used ( † CLAPSpeech-style). Neither retrieval measure ranks the systems.
Personalized text-to-speech (TTS) aims to clone the target speaker in the synthesized speech, imitating both the voice and speaking style. Current large language model (LLM)-based TTS methods ignore the style-specific prosodic patterns in generated speech, resulting in deficient style learning and thus limiting speaker similarity in synthesized speech. To this end, we investigate the prosody learning conditioned on the synthesized speech, and propose to predict the prosody of the current syllable based on previously predicted speech. Experimental results obtained on three datasets demonstrated the efficacy of the proposed dynamic prosody prediction method in enhancing the prosody learning capability, thereby improving the speaker similarity of the generated speech. Audio samples are available at https://muzw.github.io/dynapros/.
Zhenwei Mou, Liping Chen, Yajun Hu +3
University of Science and Technology of China, Anhui, China · iFLYTEK, Anhui, China
Large language model (LLM)-based text-to-speech (TTS) systems achieve remarkable naturalness via autoregressive (AR) decoding, but require N sequential steps to generate N speech tokens. We present LLaDA-TTS, which replaces the AR LLM with a masked diffusion model that completes generation in a fixed number of parallel steps, decoupling inference latency from sequence length. Remarkably, using only 50 hours of fine-tuning data, we successfully transfer a pretrained AR checkpoint to the masked diffusion paradigm via bidirectional attention. At 64 steps, LLaDA-TTS achieves 0.98% CER (zh) and 1.96% WER (en) on Seed-TTS-Eval, matching the original CosyVoice 3 baseline performance while delivering a 2x LLM-stage speedup--a notable acceleration achieved despite the absence of KV cache, an optimization the AR baseline heavily relies on. Beyond acceleration, the bidirectional architecture naturally enables zero-shot speech editing--including word-level insertion, deletion, and substitution--without any additional training. Theoretically, we prove that AR-pretrained weights are near-optimal for bidirectional masked prediction under the locality property of acoustic tokens, explaining this rapid convergence. This general method modifies only the attention mask and objective, applying seamlessly to any LLM-based AR TTS system. Code and audio samples will be available at https://deft-piroshki-b652b5.netlify.app/.
Text-to-speech (TTS) based on masked diffusion models (MDMs) achieves competitive zero-shot speech synthesis performance. Unlike autoregressive (AR) models, MDMs define a corruption process that maps clean speech-token sequences to masked maps and learn a reverse denoising process to recover the reference tokens. However, MDMs commit to intermediate predictions that cannot be revised in subsequent inference steps. Consequently, prediction errors accumulate and propagate, degrading synthesized speech quality. We present Revise-TTS, a single-stage framework that applies hierarchical binary quantization (HBQ) and generative refinement networks (GRN) to zero-shot speech generation. First, we replace finite scalar quantization (FSQ) with HBQ to introduce a scalable binary representation for speech tokens with an explicit coarse-to-fine structure. Second, GRN is trained to reconstruct the token sequence from a mixture of ground-truth and random tokens. During inference, iterative refinement enables self-correction by randomly discarding a small proportion of previously predicted tokens with new predictions. Experiments and ablation studies demonstrate that Revise-TTS achieves competitive zero-shot speech synthesis performance using HBQ. It can further be extended to any MDM-based TTS task as an alternative training and inference method.
Wanli Sun, Dan Su, Anton Ragni
School of Computer Science, University of Sheffield, Sheffield, UK · HojoAI, Beijing, China