Publication

On Learning Grapheme-to-Phoneme Relationships through the Acoustic Speech Signal

Publications associées (40)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On Joint Modelling of Grapheme and Phoneme Information using KL-HMM for ASR

Hervé Bourlard, Guillermo Aradilla

In this paper, we propose a simple approach to jointly model both grapheme and phoneme information using Kullback-Leibler divergence based HMM (KL-HMM) system. More specifically, graphemes are used as subword units and phoneme posterior probabilities estim ...

Idiap2009

A Kernel Wrapper for Phoneme Sequence Recognition

We describe a kernel wrapper, a Mercer kernel for the task of phoneme sequence recognition which is based on operations with the Gaussian kernel, and suitable for any sequence kernel classifier. We start by presenting a kernel-based algorithm for phoneme s ...

John Wiley and Sons2009

Discriminative Keyword Spotting

Samy Bengio, David Grangier

This chapter introduces a discriminative method for detecting and spotting keywords in spoken utterances. Given a word represented as a sequence of phonemes and a spoken utterance, the keyword spotter predicts the best time span of the phoneme sequence in ...

John Wiley and Sons2009

Enhancing posterior based speech recognition systems

Hamed Ketabdar

The use of local phoneme posterior probabilities has been increasingly explored for improving speech recognition systems. Hybrid hidden Markov model / artificial neural network (HMM/ANN) and Tandem are the most successful examples of such systems. In this ...

EPFL2008

Enhancing posterior based speech recognition systems

Hamed Ketabdar

Ecole Polytechnique Fédérale de Lausanne2008

Fast Approximate Spoken Term Detection from Sequence of Phonemes

Hynek Hermansky, Joel Praveen Pinto

We investigate the detection of spoken terms in conversational speech using phoneme recognition with the objective of achieving smaller index size as well as faster search speed. Speech is processed and indexed as a sequence of one best phoneme sequence. W ...

2008

Fast Approximate Spoken Term Detection from Sequence of Phonemes

Hynek Hermansky, Joel Praveen Pinto

IDIAP2008

On Confusions in a Phoneme Recognizer

Hynek Hermansky, Joel Praveen Pinto

In this paper, we analyze the confusions patterns at three places in the hybrid phoneme recognition system. The confusions are analyzed at the pronunciation, the posterior probability, and the phoneme recognizer levels. The confusions show significant stru ...

2007

On Confusions in a Phoneme Recognizer

Hynek Hermansky, Joel Praveen Pinto

IDIAP2007

Using Pitch as Prior Knowledge in Template-Based Speech Recognition

Hervé Bourlard, Guillermo Aradilla

In a previous paper on speech recognition, we showed that templates can better capture the dynamics of speech signal compared to parametric models such as hidden Markov models. The key point in template matching approaches is finding the most similar templ ...

2006