By Topic

The use of context-free grammars in isolated word 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
$31 $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)
Chirathamjaree, C. ; Edith Cowan Univ., Churchlands, WA, Australia

A method using nonrecursive context-free grammars is presented for the recognition of isolated words. Some form of 'training' is required to combat problems of variations in speech. In the training mode, one grammar for each word in the vocabulary is constructed directly from a set of sample strings of 'features' represented by symbols. In the recognition mode, an incoming string is analyzed to determine which grammar, if any, could have generated it. The word corresponding to such grammar is then said to have been recognized.

Published in:

TENCON 2004. 2004 IEEE Region 10 Conference  (Volume:B )

Date of Conference:

21-24 Nov. 2004