Proceedings ArticleDOI
Speech recognition using variable frame rate coding
C. Chuang,S. Chan +1 more
- Vol. 8, pp 1033-1036
Reads0
Chats0
TLDR
Results found are: (1) limited time sequence compression does not impose any negative effect on DP or its alternatives and (2) variable threshold scheme performs better than the fixed threshold scheme.Abstract:
This paper investigates the effect of LPC based time compression schemes on dynamic programming (DP) and its alternatives. Two compression schemes, one with fixed threshold and the other with variable threshold both incorporated with two control factors, the rate of frame overlap and the step of interframe interval, are investigated. The test speech is 40-word alpha-digit vocabulary pronounced by 10 males and 10 females. Results found are: (1) limited time sequence compression does not impose any negative effect on DP or its alternatives and (2) variable threshold scheme performs better than the fixed threshold scheme. More detailed discussion on the compression schemes and DP interaction are included.read more
Citations
More filters
Patent
Speech recognition using preclassification and spectral normalization
TL;DR: In this article, a two-stage classification process is used in a speech recognition system, in which a slope vector template is generated from an extended LPC analysis using a universal bandwidth expansion technique.
Journal ArticleDOI
An integrated-circuit-based speech recognition system
H. Murveit,R. Brodersen +1 more
TL;DR: A high-performance, flexible, and potentially inexpensive speech recognition system that can compare an input word with 1000-word templates and respond to a user within 1-4 s demonstrates that computational complexity need not be a major limiting factor in the design of speech recognition systems.
Proceedings ArticleDOI
Toward a massively parallel system for word recognition
Maurice K. Wong,Hon Wai Chun +1 more
TL;DR: A linguistic knowledge base is built into the network, allowing both data-driven processing and top-down prediction to cooperate or compete in working toward the correct lexical hypothesis.
Journal ArticleDOI
Pattern compression in isolated word recognition
TL;DR: In this work three different pattern compression techniques are compared on the basis of efficiency as well as recognition performance when applied to pattern matching by means of dynamic programming in a speaker dependent context.
Proceedings ArticleDOI
Evaluation of time compression for connected word recognition
Jean-Luc Gauvain,J. Mariani +1 more
TL;DR: The results show that the variable length trace segmentation technique gives the best scores under all conditions, and that the uniform sampling approach can therefore be advantageously used in connected word recognition processes.
References
More filters
Journal ArticleDOI
Dynamic programming algorithm optimization for spoken word recognition
TL;DR: This paper reports on an optimum dynamic progxamming (DP) based time-normalization algorithm for spoken word recognition, in which the warping function slope is restricted so as to improve discrimination between words in different categories.
Journal ArticleDOI
Minimum prediction residual principle applied to speech recognition
TL;DR: A computer system is described in which isolated words, spoken by a designated talker, are recognized through calculation of a minimum prediction residual through optimally registering the reference LPC onto the input autocorrelation coefficients using the dynamic programming algorithm.
Journal ArticleDOI
Fast sequential decoding algorithm using a stack
TL;DR: A new sequential decoding algorithm is introduced that uses stack storage at the receiver that is much simpler to describe and analyze than the Fano algorithm, and is about six times faster than the latter at transmission rates equal to Rcomp.
Journal ArticleDOI
Maximum likelihood estimation for multivariate observations of Markov sources
TL;DR: Parameter estimation for multivariate functions of Markov chains, a class of versatile statistical models for vector random processes, is discussed, and a powerful representation theorem by Fan is employed to generalize the analysis of Baum, et al. to a larger class of distributions.
Proceedings ArticleDOI
Fast nonlinear time alignment for isolated word recognition
TL;DR: A fast nonlinear time alignment method is presented, which is based on a preprocessing of the normalized speech spectrogram by means of a segmentation of the trace in the spectral feature space, which offers savings in computing time by a factor of 10 or more as compared to conventional dynamic programming.