By Topic

A grammar compiler for connected speech 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)
M. K. Brown ; AT&T Bell Lab., Murray Hill, NJ, USA ; J. G. Wilpon

A compiler for constructing optimized syntactic digraphs from easily written grammar specifications is described. These are written in a language called grammar specification language (GSL). The compiler has a preprocessing (macroexpansion) phase, a parse phase, graph code generation and compilation phases, and three optimization phases. Digraphs can also be linked together by a graph linker to form larger digraphs. Language complexity is analyzed in a statistics phase. It is demonstrated that the optimization phase yields graphs with even greater efficiency than previously achieved by hand. Some preliminary speech recognition results of applying these techniques to intermediate and large graphs are discussed. With the introduction of these tools it is now possible to provide a speech recognition user with the ability to define new task grammars in the field. GSL has been used by several untutored users with good results. Experience with GSL indicates that it is a viable medium for quickly and accurately defining grammars for use in connected speech recognition systems

Published in:

IEEE Transactions on Signal Processing  (Volume:39 ,  Issue: 1 )