DocumentCode
2998261
Title
Learning spectral-temporal dependencies using connectionist networks
Author
Lubensky, David
Author_Institution
Siemens Corp. Res. & Technol. Lab., Princeton, NJ, USA
fYear
1988
fDate
11-14 Apr 1988
Firstpage
418
Abstract
Describes the application of a layered connectionist network for continuous digit recognition using syllable based segmentation. Knowledge is distributed over many processing units. The behavior of the network in response to a particular input pattern is a collective decision based on the exchange of information among the processing units. A supervised back-propagation learning algorithm is used to repeatedly adjust the weights in the network, to minimize the difference between the actual output vector and the desired output vector. The performance of the network is compared to that of a nearest neighbor classifier trained and tested on the same database. Speaker-dependent continuous digit recognition experiments were performed using a total of 540 digit strings with an average length of 4 digits, collected from six speakers (4 male and 2 female)
Keywords
neural nets; speech recognition; connectionist networks; continuous digit recognition; database; learning spectral-temporal dependencies; nearest neighbor classifier; output vector; speaker dependent recognition; speech recognition; supervised back-propagation learning algorithm; syllable based segmentation; Databases; Decision making; Filter bank; Nearest neighbor searches; Neural networks; Pattern matching; Robustness; Speech; Testing; Training data;
fLanguage
English
Publisher
ieee
Conference_Titel
Acoustics, Speech, and Signal Processing, 1988. ICASSP-88., 1988 International Conference on
Conference_Location
New York, NY
ISSN
1520-6149
Type
conf
DOI
10.1109/ICASSP.1988.196607
Filename
196607
Link To Document