An application of recurrent nets to phone probability estimation

Authors:
A. J. Robinson
Affiliations:
Dept. of Eng., Cambridge Univ.
Venue:
IEEE Transactions on Neural Networks
Year:
1994

Citing 0
Cited 5

2005 Special Issue: Framewise phoneme classification with bidirectional LSTM and other neural network architectures

Neural Networks - 2005 Special issue: IJCNN 2005
2007 Special Issue: An experimental unification of reservoir computing methods

Neural Networks
2007 Special Issue: Automatic speech recognition using a predictive echo state network classifier

Neural Networks
A Chinese sign language recognition system based on SOFM/SRN/HMM

Pattern Recognition
Time series classification for the prediction of dialysis in critically ill patients using echo statenetworks

Engineering Applications of Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an application of recurrent networks for phone probability estimation in large vocabulary speech recognition. The need for efficient exploitation of context information is discussed; a role for which the recurrent net appears suitable. An overview of early developments of recurrent nets for phone recognition is given along with the more recent improvements that include their integration with Markov models. Recognition results are presented for the DARPA TIMIT and Resource Management tasks, and it is concluded that recurrent nets are competitive with traditional means for performing phone probability estimation