paper-with-me

Papers

An Investigation of the Relation Between Grapheme Embeddings and Pronunciation for Tacotron-based Systems

2020-10-21 · Antoine Perquin, Erica Cooper, Junichi Yamagishi

End-to-end models, particularly Tacotron-based ones, are currently a popular solution for text-to-speech synthesis. They allow the production of high-quality synthesized speech with little to no text preprocessing. Indeed, they can be trained using either graphemes or phonemes as input directly. However, in the case of grapheme inputs, little is known concerning the relation between the underlying representations learned by the model and word pronunciations. This work investigates this relation in the case of a Tacotron model trained on French graphemes. Our analysis shows that grapheme embeddings are related to phoneme information despite no such information being present during training. Thanks to this property, we show that grapheme embeddings learned by Tacotron models can be useful for tasks such as grapheme-to-phoneme conversion and control of the pronunciation in synthetic speech.

📄 PDF Abstract BibTeX arXiv:2010.10694

Code (0)

등록된 구현이 없습니다.

Tasks

Grapheme-to-Phoneme ConversionRelationSpeech Synthesistext-to-speechText to SpeechText-To-Speech Synthesis

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음
Highway Layer 설명 없음
BiGRU A Bidirectional GRU, or BiGRU, is a sequence processing model that consists of two GRUs. one taking the input in a forward…
GRU A Gated Recurrent Unit, or GRU, is a type of recurrent neural network. It is similar to an LSTM, but only has two gates - a reset…
Max Pooling Max Pooling is a pooling operation that calculates the maximum value for patches of a feature map, and uses it to create a downsampled (pooled) feature map. It is usually…
Convolution A convolution is a type of matrix operation, consisting of a kernel, a small matrix of weights, that slides over input data performing element-wise multiplication with the…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Tanh Activation 설명 없음

Similar Papers 제목 키워드 기반

Low-Resource Machine Transliteration Using Recurrent Neural Networks of Asian Languages

2018-07-01 · WS 2018 7 · Ngoc Tan Le, Fatiha Sadat

Grapheme-to-phoneme models are key components in automatic speech recognition and text-to-speech systems. With low-resource language pairs that do not have available and well-developed pronunciation lexicons, grapheme-to…

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Machine Translationspeech-recognition+6

Multimodal neural pronunciation modeling for spoken languages with logographic origin

2018-09-12 · EMNLP 2018 10 · Minh Nguyen, Gia H. Ngo, Nancy F. Chen

Graphemes of most languages encode pronunciation, though some are more explicit than others. Languages like Spanish have a straightforward mapping between its graphemes and phonemes, while this mapping is more convoluted…

No Need for a Lexicon? Evaluating the Value of the Pronunciation Lexica in End-to-End Models

2017-12-05 · Tara N. Sainath, Rohit Prabhavalkar, Shankar Kumar, Seungji Lee 외

For decades, context-dependent phonemes have been the dominant sub-word unit for conventional acoustic modeling systems. This status quo has begun to be challenged recently by end-to-end models which seek to combine acou…

Language ModelingLanguage Modelling

Learning to pronounce as measuring cross-lingual joint orthography-phonology complexity

2022-01-29 · Domenic Rosati

Machine learning models allow us to compare languages by showing how hard a task in each language might be to learn and perform well on. Following this line of investigation, we explore what makes a language "hard to pro…

Transliteration

A systematic comparison of grapheme-based vs. phoneme-based label units for encoder-decoder-attention models

2020-05-19 · Mohammad Zeineldeen, Albert Zeyer, Wei Zhou, Thomas Ng 외

Following the rationale of end-to-end modeling, CTC, RNN-T or encoder-decoder-attention models for automatic speech recognition (ASR) use graphemes or grapheme-based subword units based on e.g. byte-pair encoding (BPE). …

Automatic Speech RecognitionAutomatic Speech Recognition (ASR)Decoderspeech-recognition+1