By Topic

A N-best sentence hypotheses enumeration algorithm with duration constraints based on the two level algorithm

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

2 Author(s)
Marzal, A. ; Dept. de Sistemas Inf. y Comput., Univ. Politecnica de Valencia, Spain ; Vidal, E.

A new N-best sentence hypotheses enumeration algorithm for continuous speech recognition that correctly incorporates duration constraints and which is very efficient in practice is presented. Based on the most general two-level procedure, this algorithm provides greater flexibility in acoustic modeling than previous approaches and is very well suited for large vocabulary applications

Published in:

Pattern Recognition, 1992. Vol.III. Conference C: Image, Speech and Signal Analysis, Proceedings., 11th IAPR International Conference on

Date of Conference:

30 Aug-3 Sep 1992