Publication

Grapheme-based Automatic Speech Recognition using KL-HMM

Publications associées (32)

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

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 ...

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

Improving Continuous Speech Recognition System Performance with Grapheme Modelling

Hervé Bourlard, Hynek Hermansky, John David Scott Dines

This paper investigates automatic speech recognition system using context-dependent graphemes as subword units based on the conventional HMM/GMM system as well as TANDEM system. Experimental studies conducted on two different continuous speech recognition ...

IDIAP2005

Using auxiliary sources of knowledge for automatic speech recognition

Mathew Magimai Doss

Standard hidden Markov model (HMM) based automatic speech recognition (ASR) systems usually use cepstral features as acoustic observation and phonemes as subword units. Speech signal exhibits wide range of variability such as, due to environmental variatio ...

EPFL2005

Using Auxiliary Sources of Knowledge for Automatic Speech Recognition

École Polytechnique Fédérale de Lausanne, Computer Science Department2005

Using Auxiliary Sources of Knowledge for Automatic Speech Recognition

IDIAP2005

Phoneme vs Grapheme Based Automatic Speech Recognition

Hervé Bourlard, Hynek Hermansky, John David Scott Dines

In recent literature, different approaches have been proposed to use graphemes as subword units with implicit source of phoneme information for automatic speech recognition. The major advantage of using graphemes as subword units is that the definition of ...

IDIAP2004

Joint Decoding for Phoneme-Grapheme Continuous Speech Recognition

Hervé Bourlard, Samy Bengio

Standard ASR systems typically use phoneme as the subword units. Preliminary studies have shown that the performance of the ASR system could be improved by using grapheme as additional subword units. In this paper, we investigate such a system where the wo ...

2004

Joint Decoding for Phoneme-Grapheme Continuous Speech Recognition

Hervé Bourlard, Samy Bengio

IDIAP2003