By Topic

K-subspaces and time-delay autoassociators for phoneme recognition

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Duanpei Wu ; Dept. of Electr. & Comput. Eng., Clemson Univ., SC, USA ; J. N. Gowdy

This paper presents a new approach using time-delay autoassociators (TDAA) to perform phoneme recognition. The time-delay autoassociator combines the time-delay design for phoneme recognition and the technique of multilayer perceptron autoassociators. Each time-delay autoassociator is constructed and trained to model one and only one phoneme using data belonging to that phoneme category. This non-classification training procedure provides a method with high recognition performance to avoid the drawback encountered in most conventional speech recognition neural networks that the network output values do not represent candidate likelihoods. The approach with the proposed architecture, K-subspaces with linear time-delay autoassociators, in which each phoneme is modelled by K linear TDAAs, has yielded a high recognition performance compared to that of a time delay neural net and a shift-tolerant LVQ trained by classification learning procedures, over the three difficult phonemes “B”, “D” and “G”. It has also been observed that the nonlinear time-delay autoassociators could perform better than linear ones

Published in:

Neural Networks, 1996., IEEE International Conference on  (Volume:4 )

Date of Conference:

3-6 Jun 1996