By Topic

Some applications of second-order connectionist networks to speech recognition problems

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

1 Author(s)
R. L. Watrous ; Siemens Corp. Res., Princeton, NJ, USA

Second-order connectionist networks have been identified as good models for representing acoustic phonetic invariance, since they can modulate separating hypersurfaces or transform data representations as a function of context. These capabilities are illustrated for two problems in vowel recognition: speaker normalization and phonetic context dependency. The idea of context dependency can also be extended to the notion of state in recurrent networks. Second-order recurrent networks that recognize simple finite state languages over {0,1}* have been induced from positive and negative examples. Some implications of these results for recognizing phoneme sequences are discussed

Published in:

Neuroinformatics and Neurocomputers, 1992., RNNS/IEEE Symposium on

Date of Conference:

7-10 Oct 1992