Phoneme discrimination using connectionist networks.
The application of connectionist networks to speech recognition is assessed using a set of eight representative phonetic discrimination problems chose with respect to a theory of phonetics. A connectionist network model called the temporal flow model (TFM) is defined which represents temporal relationships using delay links and permits general patterns of connectivity. It is argued that the model has properties appropriate for time varying signals such as speech. Networks are trained using gradient descent methods of iterative nonlinear optimization to reduce the mean-squared error between the actual and the desired response of the output units. Separate network solutions are demonstrated for all eight phonetic discrimination problems for one male speaker. The network solutions are analyzed carefully and are shown in every case to make use of known acoustic phonetic cues. The network solutions vary in the degree to which they make use of context-dependent cues to achieve phoneme recognition. The network solutions were tested on data not used for training and achieved an average accuracy of 99.5%. It is concluded that acoustic phonetic speech recognition can be accomplished using connectionist networks.
Watrous
R L
RL
Department of Computer and Information Science, University of Pennsylvania, Philadelphia 19104-6389.
D000465:Algorithms; D001306:Auditory Pathways / Q000502:physiology*; D003198:Computer Simulation; D006801:Humans; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D009424:Nervous System Physiological Phenomena; D009474:Neurons / Q000502:physiology; D010700:Phonetics; D012815:Signal Processing, Computer-Assisted; D013018:Sound Spectrography / Q000379:methods; D013061:Speech Acoustics; D013067:Speech Perception / Q000502:physiology*