Running summarizing tools on a new article

Check the paper below, then start its synthesis.


Matcha-TTS: A Fast TTS Architecture with Conditional Flow Matching

Shivam Mehta (KTH Royal Institute of Technology), Ruibo Tu (KTH Royal Institute of Technology), Jonas Beskow (KTH Royal Institute of Technology), Éva Székely (KTH Royal Institute of Technology), Gustav Eje Henter (KTH Royal Institute of Technology)

IEEE International Conference on Acoustics Speech and Signal Processing
License: Public domain

Abstract: We introduce Matcha-TTS, a new encoder-decoder architecture for speedy TTS acoustic modelling, trained using optimal-transport conditional flow matching (OT-CFM). This yields an ODE-based decoder capable of high output quality in fewer synthesis steps than models trained using score matching. Careful design choices additionally ensure each synthesis step is fast to run. The method is probabilistic, non-autoregressive, and learns to speak from scratch without external alignments. Compared to strong pre-trained baseline models, the Matcha-TTS system has the smallest memory footprint, rivals the speed of the fastest model on long utterances, and attains the highest mean opinion score in a listening test.

Published on 18 Mar. 2024