TO COMMUNICATE with each other, humans generally

Similar documents
Speech Emotion Recognition Using Support Vector Machine

Design Of An Automatic Speaker Recognition System Using MFCC, Vector Quantization And LBG Algorithm

International Journal of Computational Intelligence and Informatics, Vol. 1 : No. 4, January - March 2012

AUTOMATIC DETECTION OF PROLONGED FRICATIVE PHONEMES WITH THE HIDDEN MARKOV MODELS APPROACH 1. INTRODUCTION

Human Emotion Recognition From Speech

Class-Discriminative Weighted Distortion Measure for VQ-Based Speaker Identification

WHEN THERE IS A mismatch between the acoustic

A Comparison of DHMM and DTW for Isolated Digits Recognition System of Arabic Language

Analysis of Emotion Recognition System through Speech Signal Using KNN & GMM Classifier

A study of speaker adaptation for DNN-based speech synthesis

Speech Segmentation Using Probabilistic Phonetic Feature Hierarchy and Support Vector Machines

Phonetic- and Speaker-Discriminant Features for Speaker Recognition. Research Project

Speaker recognition using universal background model on YOHO database

Unvoiced Landmark Detection for Segment-based Mandarin Continuous Speech Recognition

Quarterly Progress and Status Report. VCV-sequencies in a preliminary text-to-speech system for female speech

Speech Recognition using Acoustic Landmarks and Binary Phonetic Feature Classifiers

Learning Methods in Multilingual Speech Recognition

Modeling function word errors in DNN-HMM based LVCSR systems

The NICT/ATR speech synthesis system for the Blizzard Challenge 2008

Speech Synthesis in Noisy Environment by Enhancing Strength of Excitation and Formant Prominence

Eli Yamamoto, Satoshi Nakamura, Kiyohiro Shikano. Graduate School of Information Science, Nara Institute of Science & Technology

Speech Recognition at ICSI: Broadcast News and beyond

Speaker Recognition. Speaker Diarization and Identification

Modeling function word errors in DNN-HMM based LVCSR systems

Speaker Identification by Comparison of Smart Methods. Abstract

Robust Speech Recognition using DNN-HMM Acoustic Model Combining Noise-aware training with Spectral Subtraction

Mandarin Lexical Tone Recognition: The Gating Paradigm

Automatic Pronunciation Checker

Automatic segmentation of continuous speech using minimum phase group delay functions

Likelihood-Maximizing Beamforming for Robust Hands-Free Speech Recognition

Noise-Adaptive Perceptual Weighting in the AMR-WB Encoder for Increased Speech Loudness in Adverse Far-End Noise Conditions

SARDNET: A Self-Organizing Feature Map for Sequences

On the Formation of Phoneme Categories in DNN Acoustic Models

Proceedings of Meetings on Acoustics

have to be modeled) or isolated words. Output of the system is a grapheme-tophoneme conversion system which takes as its input the spelling of words,

Lecture 9: Speech Recognition

Voice conversion through vector quantization

Vimala.C Project Fellow, Department of Computer Science Avinashilingam Institute for Home Science and Higher Education and Women Coimbatore, India

BAUM-WELCH TRAINING FOR SEGMENT-BASED SPEECH RECOGNITION. Han Shu, I. Lee Hetherington, and James Glass

ADVANCES IN DEEP NEURAL NETWORK APPROACHES TO SPEAKER RECOGNITION

Segregation of Unvoiced Speech from Nonspeech Interference

DOMAIN MISMATCH COMPENSATION FOR SPEAKER RECOGNITION USING A LIBRARY OF WHITENERS. Elliot Singer and Douglas Reynolds

Speech Recognition by Indexing and Sequencing

International Journal of Advanced Networking Applications (IJANA) ISSN No. :

UNIDIRECTIONAL LONG SHORT-TERM MEMORY RECURRENT NEURAL NETWORK WITH RECURRENT OUTPUT LAYER FOR LOW-LATENCY SPEECH SYNTHESIS. Heiga Zen, Haşim Sak

Learning Methods for Fuzzy Systems

STUDIES WITH FABRICATED SWITCHBOARD DATA: EXPLORING SOURCES OF MODEL-DATA MISMATCH

A comparison of spectral smoothing methods for segment concatenation based speech synthesis

A New Perspective on Combining GMM and DNN Frameworks for Speaker Adaptation

Semi-Supervised GMM and DNN Acoustic Model Training with Multi-system Combination and Confidence Re-calibration

Quarterly Progress and Status Report. Voiced-voiceless distinction in alaryngeal speech - acoustic and articula

QuickStroke: An Incremental On-line Chinese Handwriting Recognition System

Perceptual scaling of voice identity: common dimensions for different vowels and speakers

A Neural Network GUI Tested on Text-To-Phoneme Mapping

Module 12. Machine Learning. Version 2 CSE IIT, Kharagpur

IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 17, NO. 3, MARCH

OPTIMIZATINON OF TRAINING SETS FOR HEBBIAN-LEARNING- BASED CLASSIFIERS

Calibration of Confidence Measures in Speech Recognition

Body-Conducted Speech Recognition and its Application to Speech Support System

INPE São José dos Campos

UTD-CRSS Systems for 2012 NIST Speaker Recognition Evaluation

Analysis of Speech Recognition Models for Real Time Captioning and Post Lecture Transcription

Digital Signal Processing: Speaker Recognition Final Report (Complete Version)

A NOVEL SCHEME FOR SPEAKER RECOGNITION USING A PHONETICALLY-AWARE DEEP NEURAL NETWORK. Yun Lei Nicolas Scheffer Luciana Ferrer Mitchell McLaren

The Perception of Nasalized Vowels in American English: An Investigation of On-line Use of Vowel Nasalization in Lexical Access

INVESTIGATION OF UNSUPERVISED ADAPTATION OF DNN ACOUSTIC MODELS WITH FILTER BANK INPUT

On Developing Acoustic Models Using HTK. M.A. Spaans BSc.

Statewide Framework Document for:

BUILDING CONTEXT-DEPENDENT DNN ACOUSTIC MODELS USING KULLBACK-LEIBLER DIVERGENCE-BASED STATE TYING

Experiments with SMS Translation and Stochastic Gradient Descent in Spanish Text Author Profiling

Learning Structural Correspondences Across Different Linguistic Domains with Synchronous Neural Language Models

Evolutive Neural Net Fuzzy Filtering: Basic Description

Investigation on Mandarin Broadcast News Speech Recognition

Rhythm-typology revisited.

The Good Judgment Project: A large scale test of different methods of combining expert predictions

Assignment 1: Predicting Amazon Review Ratings

Probabilistic Latent Semantic Analysis

PREDICTING SPEECH RECOGNITION CONFIDENCE USING DEEP LEARNING WITH WORD IDENTITY AND SCORE FEATURES

arxiv: v1 [math.at] 10 Jan 2016

Word Segmentation of Off-line Handwritten Documents

Author's personal copy

Expressive speech synthesis: a review

Culture, Tourism and the Centre for Education Statistics: Research Papers

PRODUCT COMPLEXITY: A NEW MODELLING COURSE IN THE INDUSTRIAL DESIGN PROGRAM AT THE UNIVERSITY OF TWENTE

Large vocabulary off-line handwriting recognition: A survey

Learning Optimal Dialogue Strategies: A Case Study of a Spoken Dialogue Agent for

AP Calculus AB. Nevada Academic Standards that are assessable at the local level only.

Reducing Features to Improve Bug Prediction

BODY LANGUAGE ANIMATION SYNTHESIS FROM PROSODY AN HONORS THESIS SUBMITTED TO THE DEPARTMENT OF COMPUTER SCIENCE OF STANFORD UNIVERSITY

Support Vector Machines for Speaker and Language Recognition

Malicious User Suppression for Cooperative Spectrum Sensing in Cognitive Radio Networks using Dixon s Outlier Detection Method

Phonological Processing for Urdu Text to Speech System

Lecture 1: Machine Learning Basics

Chinese Language Parsing with Maximum-Entropy-Inspired Parser

THE RECOGNITION OF SPEECH BY MACHINE

Lip reading: Japanese vowel recognition by tracking temporal changes of lip shape

Disambiguation of Thai Personal Name from Online News Articles

An Online Handwriting Recognition System For Turkish

Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining

Evaluation of Usage Patterns for Web-based Educational Systems using Web Mining

Transcription:

IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL. 7, NO. 5, SEPTEMBER 1999 525 Generalized Mel Frequency Cepstral Coefficients for Large-Vocabulary Speaker-Independent Continuous-Speech Recognition Rivarol Vergin, Douglas O Shaughnessy, Senior Member, IEEE, and Azarshid Farhat Abstract The focus of a continuous speech recognition process is to match an input signal with a set of words or sentences according to some optimality criteria. The first step of this process is parameterization, whose major task is data reduction by converting the input signal into parameters while preserving virtually all of the speech signal information dealing with the text message. This contribution presents a detailed analysis of a widely used set of parameters, the mel frequency cepstral coefficients (MFCC s), and suggests a new parameterization approach taking into account the whole energy zone in the spectrum. Results obtained with the proposed new coefficients give a confidence interval about their use in a large-vocabulary speaker-independent continuous-speech recognition system. Index Terms Cepstral coefficients, mel scale, speech recognition. I. INTRODUCTION TO COMMUNICATE with each other, humans generally use language that is based on a finite set of articulated sounds. The meaning of the transmitted message depends on the organization of the elements in this set; these elementary sounds are usually called phonemes. Many aspects of language have been studied over the years. Some of these works are focused on the variation of pronunciation [1] or intonation [2] in natural language. However, the basic interest seems to be on the acoustic level, interest that is aimed at two particular applications: automatic speech synthesis and recognition. In the case of synthesis, the research emphasizes the identification of phoneme characteristics in the frequency domain for a better representation of the system that reproduces them. In the case of recognition, the priority is to extract from the acoustic signal enough information such that the recognition of phonemes, words or sentences that contain these phonemes can be possible. In this paper, our attention is devoted to this last application, that is, extracting from the input signal the acoustic information of the word or the sentence pronounced by the speaker. This operation often allows us to obtain a set of parameters or coefficients fewer in number than the initial Manuscript received August 30, 1996; revised January 31, 1999. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Mazin Rahim. The authors are with the INRS-Télécommunications, Île-des-Sœurs H3E 1H6, P.Q., Canada (e-mail: vergin@inrs-telecom.uquebec.ca). Publisher Item Identifier S 1063-6676(99)06566-9. input samples, while maintaining, in most of the cases, the correct representation of different units that constitute speech. Common parameters used in many recognition systems are LPC (linear predictive coding) coefficients, and mel frequency cepstral coefficients (MFCC s). Some recent works show how the variability of the statistical components of LPC can be reduced using bandpass liftering [3]; others [4], [5] are focused on finding an optimal linear transformation of mel-warped short-time discrete Fourier transform (DFT) information to minimize the errors occurring at the back-end classifier. However, the most popular set of parameters is the MFCC developed by Davis and Mermelstein [6]. It is the main purpose of this contribution to detail and analyze the evaluation process of the MFCC, highlighting positive as well as negative aspects of this approach. If the idea of mapping an acoustic frequency to a perceptual frequency scale, the mel scale, permits one to obtain relevant coefficients, we cannot, however, conclude that the filtering process occurring in the evaluation of the MFCC does not alter the initial frequency resolution obtained after the fast Fourier transform (FFT). Since it is not quite clear what is the optimal frequency resolution from which a set of parameters for a recognition system has to be evaluated, we propose in this paper a new algorithm respecting the fundamental concept of the mel scale while keeping unchanged the initial frequency resolution obtained after the FFT. Comparative results let us believe that the suggested approach is very promising. Due to physiological characteristics of the speech production system [7], voiced sections of the speech signal have an attenuation of approximately 20 db per decade. To counterbalance this negative slope, a preemphasis filter is generally used before spectral analysis. Unfortunately, preemphasis filters also raise spectral energy above 4 khz, and in the case of vowels and nasals energy above 4 khz can be largely considered as noise. Many speech recognition systems have eliminated the preemphasis stage and compensate for the spectral slope as part of the speech recognition statistical model. It is shown in this paper how an adaptable spectral compensation algorithm [8] can be used to reduce the bad effects of the preemphasis in the case of voiced sounds. In Section II, we present a detailed analysis of an evaluation procedure of mel frequency cepstral coefficients with a particular emphasis on positive and negative points related to this technique. In Section III, we describe two different approaches that partially solve the bad effects of the MFCC. 1063 6676/99$10.00 1999 IEEE

526 IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL. 7, NO. 5, SEPTEMBER 1999 In Section IV, the adaptable spectral compensation algorithm is reviewed. In Section V, we briefly describe our recognizer and show comparative results between the MFCC, bandpass liftering, and the new proposed coefficients. II. EVALUATION OF MFCC The focus of a continuous-speech recognition process is to match an input signal with a set of words or sentences according to some optimality criteria. The first step of this process is often referred to as parameterization. The major task of this step is data reduction in converting the input signal into parameters while preserving virtually all of the speech signal information dealing with the text message. One of the most popular sets of parameters used in recognition systems is the MFCC, introduced in [4]. The evaluation techniques of these coefficients can be summarized as follows, assuming that is the input speech signal. 1) Calculate the energy spectrum: Fig. 1. Filter allocation in the frequency domain before normalization. (1) where, corresponding to 30 ms, is usually the dimension of the Hanning window given by weighting factors given by which leads to the following equation: (7) (2) is a normalization factor [9] defined so that the root mean square value of the window is unity. The energy spectrum is given by where is taken equal to because only half of the spectrum is considered. 2) Calculate the energy in each channel (3) (4) where, generally equal to 24, is the number of triangular filters used, with the following constraint: The distribution of these filters before normalization (after Davis and Merlmestein [6] and Picone [9]) is shown in Fig. 1. 3) Calculate the MFCC: (5) (6) This last equation can also be shown as a scalar product between the log spectral energy vector and a vector of (8) The amplification factor,, which accommodates the dynamic range of the coefficients, depends on the value of the normalization factor. In our implementation is taken equal to 200 and its value does not change with. Generally, only the first 15 values of are retained. A. Analysis of MFCC Constraints The most useful parameters in speech processing are found in the frequency domain, because the vocal tract produces signals that are more consistently and easily analyzed spectrally than in the time domain. Repeated utterances of a sentence by one speaker often differ considerably in the time domain while remaining quite similar in the frequency domain [10]. For these reasons, spectral analysis is used primarily to extract relevant parameters from speech signals and to discriminate between elementary sounds that compose the language, that is, the phonemes. As the traditional spectral technique, Fourier analysis provides a representation of speech in terms of amplitude and phase as a function of frequency. Since the phase information is usually of minimal interest, only the magnitude of the complex values is retained, typically on a logarithmic scale (following the dynamic range effects of the ear). Since most speech is nonstationary, a short-time Fourier transform, using a window, is generally preferred. A typical duration of the window is 30 ms, which yields a frequency resolution,, of approximately 31.25 Hz for a signal sampled at 16 khz.

VERGIN et al.: SPEAKER-INDEPENDENT CONTINUOUS-SPEECH RECOGNITION 527 the logarithm scale. When is represented in the frequency domain, Fig. 2, two important points appear: 1) the distance between each pair of points is at least 100 Hz and increases with frequency; 2) the set of points,, leads to a curve that does not respect the equal spacing of harmonic series because the length of sucessive half-cycles increases with frequency. Point 1 seems to be a nuisance because it can affect the efficiency of parameters that characterize speech. Point 2 is what gives to MFCC s their unique importance, in the sense that the energy spectrum is not weighted in an equal way at low frequency as at high frequency. Our goal in this section is to increase the frequency resolution of the weighting factors while keeping the global form of the curve unchanged. Fig. 2. Distribution of weighting factors for c5. 1) Negative Effects of the Filtering Process: If a discrimination between phonemes is possible in the frequency domain, by looking for the positions of most energy concentration, it remains a consequence of the frequency resolution used during the analysis, because some phonemes, particularly vowels, do not have formant positions widely spaced in frequency. It is reasonable in this case to say that the filtering process as used in the evaluation of the MFCC can be a nuisance, because the frequency resolution obtained with this technique is about 100 Hz at low frequency. An illustration of the effects of the filtering process in reducing the frequency resolution is shown in Fig. 2. This curve represents the distribution of the weighting factors for the fifth mel frequency cepstral coefficient. Each weighting factor,, with: is placed at their real position, in the frequency domain, defined by the center of each filter. Specifically, lies at the same position where is located in frequency. According to this figure, we can conclude that the evaluation technique of MFCC alters the initial frequency resolution obtained after the FFT. In the following sections, we assume that the key point in MFCC is the global form of the curve shown in Fig. 2, and suggest some new algorithms allowing us to increase the resolution of the weighting factors while keeping unchanged the main features of the curve. Comparative results presented at Section V, give a confidence interval about the use of these new algorithms in a continuous speech recognition system. (9) A. Interpolation Procedure Sometimes the value of a function,, is known at a set of points, but evaluation of its value at an arbitrary point is not possible because we do not have an analytic expression for. The task is to estimate for arbitrary by drawing a smooth curve through or beyond the. When the desired is between the largest and the smallest of the s, the problem is called interpolation [11]. The goal of the interpolation scheme is to model the function, between or beyond the known points, by some plausible functional form. Most common among functional forms used are polynomials [12], rational functions [13], and trigonometric functions [14]. However, in our case the function used to evaluate is known, (7) therefore the best possible interpolation for this problem is provided by the basic function (10) to which an additional index is added to account for each energy element between and. The new function is defined by In this equation, is the total number of elements between and and is given by (11) (12) where and are, respectively, the positions in the frequency domain of filters and used to evaluate and, and is the initial frequency resolution. Defining as a set of weighting factors between and, for a particular value of : (13) III. HIGH RESOLUTION WEIGHTING FACTORS As described by (8), an evaluation of the MFCC can be viewed as a scalar product between a set of vectors,, and a vector of energy whose elements,, are taken on The collection of given by (14)

528 IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL. 7, NO. 5, SEPTEMBER 1999 The coefficients associated with are given by (17) The coefficients associated with are given by (18) Since, the second term of the right-hand part of (18) is not equal to zero. It results that: (19) This would not be the case if the coefficients had been evaluated according to the classical method of the mel frequency cepstrum, because Fig. 3. Distribution of weighting factors for ^c5. which is a new vector of weighting factors, can be used to evaluate a new set of coefficients: (15) The amplification factor can be adjusted in such a way that the dynamic range of is approximately the same as for. The interpolation procedure has a number of interesting characteristics, as follows. 1) The elements are used instead of, which avoids the use of the set of filters. 2) The frequency resolution of the weighting factors is increased, because is defined on the interval whereas is defined on the interval. 3) The global form of the curve described by (Fig. 3) is the same as for the curve described by (Fig. 2). Unfortunately, this approach does not have only beneficial effects. Its basic deficiency is explained in the next section. 1) Constraints of the Interpolation Procedure: The interpolation procedure as described in the previous section has some interesting properties when it is compared with the basic way that MFCC s are evaluated. Its negative effect is the sensitivity of coefficients to the amplitude of the input signal. This comes from the fact that (16) As an example, the sum over of is approximately 12.68. To clarify the effects of (16), suppose that for an input utterance the energy spectrum is and for another input utterance the energy spectrum is ; that is, the spectra of the new utterance is a constant,, times the previous one. (20) The interest for this kind of analysis comes from the fact that the coefficients evaluated from the spectra of the input signal are to be used in continuous-speech recognition systems. Most of these systems use phonemes or pairs of phonemes as basic units, which are concatenated together to form sequences of words or sentences that better match the acoustic input signal. Obviously, if the input parameters take different values for two utterances which differ only by an amplification factor, the recognition task will be more difficult. The next section suggests a new approach to overcome this problem. B. Generalized MFCC s It is essential to realize that the global form of the curve shown in Fig. 2, which, we assume, is the chief feature of the mel frequency cepstral coefficients, comes (see Fig. 1) from the distribution of filters in the frequency domain. They are equally spaced from 0 1000 Hz, and their spacing increases continuously beyond 1000 Hz. There is a great similarity between the spacing of these filters and the human perception scale [10], the mel scale, which maps an acoustic frequency to a perceptual frequency scale as follows: mel frequency (21) The proposed algorithm presented in this section is based on this equation and involves the following steps, for each value of. 1) Evaluate a vector of position, whose elements,, are given by (22) The right side of this equation is based on the inverse of (21), defining the mel scale. The value is chosen in such a way that the last element,,is equal to 8000 Hz.

VERGIN et al.: SPEAKER-INDEPENDENT CONTINUOUS-SPEECH RECOGNITION 529 vector and a set or vector of weighting factors, taken as the base of projection. It is also shown (Section III-B) how more details in the spectrum can be taken into account with a new set of weighting factors. Sections IV-A and IV-B review a spectral compensation technique making more relevant the whole energy zone in the spectrum. A. Preemphasis Due to physiological characteristics of the speech production system [7], voiced sections of the speech signal have an attenuation of approximately 20 db per decade. To counterbalance this negative slope, a preemphasis filter is generally used before spectral analysis. That is, the input to the spectral analyzer is (26) Fig. 4. style). Superposition of weighting factors ~ W5 (line style) and W5 (point 2) Define between each pair of elements, and, a subset of vectors,, given by (23) where is the total number of energy elements between and. 3) Concatenate all the vectors for to obtain the final vector, that is, (24) Vector contains the same number of elements as the initial spectral energy vector. 4) Evaluate a set of coefficients The constant, whose value is about 0.94, determines the cutoff frequency of the single-zero filter through which passes. The idea is to reduce the dynamic range of the spectrum by adding a zero to counteract the spectral falloff due to the glottal source, which yields formants with similar amplitudes. Unfortunately preemphasis filters also raise spectral energy above 4 khz, and in the case of vowels and nasals energy above 4 khz can be considered as noise. For these particular sounds, the preemphasis can induce unexpected variability in the coefficients extracted from the spectrum. Many speech recognition systems have eliminated the preemphasis stage and compensate for the spectral slope as part of the speech recognition statistical model. B. Compensation The use of an adaptable compensation algorithm [8] appears as a tenable way to reduce the bad effects of preemphasis above 4 khz in some cases. Since these negative effects are more crucial in the voiced part of the speech signal, there is a need for a voicing index; the simplest is (25) The parameter is an amplification factor which accommodates the dynamic range of. Clearly the set of vectors does not form an orthogonal base. This problem can be easily solved through the use of a Gram Schmidt orthogonalization procedure. Fig. 4 shows as an example the curves of the two sets of weighting factors and. Their contours keep the same tendency. This is a surprising result because they are evaluated according to two different techniques. However, since the sum over of is equal to zero for all values of, which is not the case for (16), the coefficients are, from an analytical point of view, a more accurate set of coefficients than (15). IV. COMPENSATED SPECTRUM In Section II, it was demonstrated that the parameterization process results in a scalar product between the spectral energy (27) where is the spectral energy vector of the preemphasized signal. When tends to one, the signal is more likely voiced, whereas an approximately zero value for indicates an unvoiced signal. We have conducted many experiments using the voicing index, and it appears to be relatively sensitive to local variations in successive spectra. A refined voicing index defined by (28) gives us better results, that is, its successive values, derived from successive spectra, yield a more continuous curve. The compensated spectrum is given by (29)

530 IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL. 7, NO. 5, SEPTEMBER 1999 Fig. 5. Variations of according to the concentration of energy at low frequency. where is a balanced vector of the same dimension as, whose elements define how each spectral energy component,, has to be weighted. Since decreases as increases, the process tends to eliminate the negative effects of the preemphasis at high frequencies (above 4 khz). The voicing index allows for an adaptation of the compensation process according to the concentration of energy at low frequencies, because when the signal is unvoiced the preemphasis does not have bad effect. Fig. 5 shows the curves of for different values of. A typical value of is 0.8 for vowels and nasals, and 0.3 for unvoiced consonants. Comparative results between different energy spectra,, and can be shown in [8]. It can be observed that the preemphasis combined with the compensation process effectively increases the recognition rate. All experiments mentioned in the next section have been conducted using the spectral energy vector. The only exception is for experiments using liftered cepstral coefficients, because in this case the compensation algorithm cannot be applied. V. OVERVIEW OF THE INRS CONTINUOUS-SPEECH RECOGNIZER The INRS speech recognizer [15] is a large-vocabulary, speaker-independent continuous-speech recognition system. The speech data are divided into temporal blocks to accommodate memory problems associated with the classical forward-backward algorithm. The recognition process is based on a two-pass search technique on the current block. The results of each block are passed to the next and the same process is repeated until no more data is available. The first pass uses coarse acoustic and language models to generate recognition hypotheses, which are rescored in the second pass using fine acoustic and language models. In the baseline system, the speech signal is sampled at 16 khz. Every 10 ms, a set of 15 coefficients and their first-order derivatives are computed using a Hanning window of 30 ms. Thus, the acoustical vectors have 30 components. The acoustic-phonetic models are three-state left-to-right hidden Markov models (HMM s) with no skip transitions. At the present time these HMM s represent right contextdependent phones in both the first and second passes. The output distributions of the HMM s are modeled by tiedmixtures. A statistical language model (n-grams), whose role is to provide an a priori probability distribution of strings in the dictionary, is used in the system. In the first pass a bigram model is used, while in the second pass a trigram model is used. The output of the recognizer is a succession of words that match well the input speech data according to the language model. The speech corpus used in these experiments came from Air Travel Information System (ATIS) corpora, with a vocabulary of 1087 words. 285 speakers with a total of 9269 sentences are used for the training. The tests are achieved with ten other speakers with a total of 803 sentences. Males and females are present in both training and testing sets. The system uses a single set of acoustic-phonetic models; that is, no distinction is made between men and women. A. Comparative Results Table I(a) shows comparative results between liftered cepstral coefficients and MFCC s. For our type of recognizer, MFCC s seem to be a more appropriate set of coefficients than liftered cepstral coefficients. Table I(b) shows comparative results between the classical MFCC and the interpolation procedure described in Section III-A. Since results obtained with the interpolation procedure are not better than those obtained with MFCC, increasing the frequency resolution of the base of projection is not the only point to be considered during the evaluation of the input parameters. Indeed, some negative effects of the interpolation procedure described in Section III-A1 can partially explain the difference in results observed. Table II(a) shows comparative results between two different bases of projection and. The first have been evaluated using the interpolation procedure described in Section III-A and the second have been evaluated using the new algorithm described in Section III-B. It can be observed that results obtained with are better than those obtained with MFCC and also better than those obtained with the interpolation procedure. does not contain the bad effects associated with, that is, the sum over of is equal to zero for all which is not the case for. Table II(b) shows the difference in results obtained with a base of projection not orthogonalized and a base of projection orthogonalized using the Gram Schmidt procedure. The recognition rate increases with an orthogonal base

VERGIN et al.: SPEAKER-INDEPENDENT CONTINUOUS-SPEECH RECOGNITION 531 TABLE I (a) RESULTS OBTAINED WITH LIFTERED CEPSTRAL COEFFICIENTS AND MFCC. (b) RESULTS OBTAINED WITH MFCC AND INTERPOLATION PROCEDURE TABLE II (a) RESULTS OBTAINED WITH Wm AND Wm. ~ (b) RESULTS OBTAINED WHEN GRAM SCHMIDT PROCEDURE IS APPLIED OR NOT ON ~ Wm (a) (a) (b) (b) of projection. All these results tend to prove that performance of a recognition system is closely related to the level of details that are taken into account during the evaluation of an input set of parameters. The tests are achieved with ten speakers including males and females. The recognition rate obtained with the algorithm proposed in Section III-B is 90.69%, while the recognition rate obtained with MFCC is 89.33%. For eight speakers, results obtained with the new algorithm are greater or equal than results obtained with MFCC. On average, for all the parameters tested in this paper, recognition accuracies obtained for men are greater than those obtained for women. One possible cause of this difference is the use of a single set of acousticphonetic models, that is, during the training and the recognition phases, no distinction is made between men and women. Our conclusions about the performance of different sets of parameters remain true in a mean sense. Our experiments also show that the number of word hypotheses, for each block, is lower with (24) than with (7). This leads us to believe that the suggested approach is very promising and should be further investigated for memory reduction in a continuous speech recognition system. VI. CONCLUSION This paper is firstly devoted to a detailed analysis of the evaluation procedure of the MFCC s. It has been shown that generalizing this approach can allow us to construct a base of projection taking into account the whole energy zone in the spectrum. This interesting consideration is not enough, however, to increase the performance of a recognition system. Some other important points like the orthogonalization of the base of projection have to be considered. The key point of this contribution is the new algorithm (Section III-B) suggested to evaluate the base of projection; since it is based on the equation defining the mel scale, its use had beneficial effects on this base of projection and accordingly on the recognition rate. Results obtained with the new set of coefficients let us conclude that significant improvement of the recognition rate lies in details retained during the parameterization process. REFERENCES [1] P. Lieberman, Intonation, Perception and Language. Cambridge, MA: MIT Press, 1967. [2] J. Vaissiére, The use of prosodic parameters in automatic speech recognition, in Recent Advances in Speech Understanding and Dialog

532 IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING, VOL. 7, NO. 5, SEPTEMBER 1999 Systems. Berlin, Germany: Niemann, Lang and Sagerer, 1988, pp. 71 99. [3] B. Juang, L. Rabiner, and J. Wilpon, On the use of bandpass liftering in speech recognition, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-35, pp. 947 954, July 1987. [4] A. Biem, E. McDermott and S. Katagiri, A discriminative filter bank model for speech recognition, in ESCA EUROSPEECH 95, Madrid, Spain, Sept. 1995. [5] C. Rathinavelu and L. Deng, HMM-based speech recognition using state-dependent linear transforms on mel-warped DFT features, in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, May 1996. [6] S. Davis and P. Mermelstein, Comparison of parametric representations for monosyllabic word recognition, IEEE Trans. Acoust., Speech, Signal Processing, vol. ASSP-28, pp. 357 366, 1980. [7] J. Markel and A. H. Gray, Linear Prediction of Speech. Berlin, Germany: Springer-Verlag, 1976. [8] R. Vergin, D. O Shaughnessy, and V. Gupta, Compensated mel frequency cepstrum coefficients, in Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing, May 1996. [9] J. W. Picone, Signal modeling techniques in speech recognition, Proc. IEEE, vol. 81, pp. 1215 1247, 1993. [10] D. O Shaughnessy, Speech Communication: Human and Machine. Reading, MA: Addison-Wesley, 1987. [11] W. Press, S. Teukolsky, W. Vetterling, and B. Flannery, Numerical Recipes in C, The Art of Scientific Computing. Cambridge, U.K.: Cambridge Univ. Press, 1992. [12] J. Stoer and R. Bulirsh, Introduction to Numerical Analysis. Berlin, Germany: Springer-Verlag, 1980. [13] A. Cuyt and L. Wuytack, Nonlinear Methods in Numerical Analysis. Amsterdam, The Netherlands: North-Holland, 1987. [14] R. Hockney, Methods in Computational Physics. New York: Academic, 1971. [15] P. Kenny et al., Experiments in continuous speech recognition with a 60 000 word vocabulary, in Int. Conf. Spoken Language Processing, Banff, Alta., Canada, 1992, pp. 225 228. Douglas O Shaughnessy (S 74 M 76 SM 89) received the Ph.D. degree from the Massachusetts Institute of Technology, Cambridge, in 1976. He has been a Professor at INRS- Telecommunications, University of Quebec, Montreal, P.Q., Canada, since 1977. For this same period, he has also taught as Adjunct Professor at the Department of Electrical Engineering, McGill University. His teaching and research work lies in the areas of speech communications (automatic speech synthesis, analysis, coding, and recognition) and digital signal processing. His research team is currently concentrating on voice dialogs in English and French. He is the author of the textbook Speech Communication: Human and Machine, to be published in revised edition in 1999 by IEEE Press. Dr. O Shaughnessy has been an Associate Editor for the IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING since 1994, and is also an Associate Editor the the Journal of the Acoustical Society of America. He was elected Fellow of the Acoustical Society of America in 1992. Azarshid Farhat, photograph and biography not available at the time of publication. Rivarol Vergin was born in Haiti. He received the B.S. and M.S. degrees in electrical engineering from the Ecole Polytechnique, Montreal, P.Q., Canada, and the Ph.D. degree in telecommunications from the Institut National de la Recherche Scientifique in 1996. From 1996 to 1998, he was a Design Engineer at CML Technologies, Quebec, P.Q., Canada. He is currently an Assistant Professor of electrical engineering at Université de Moncton, Moncton, N.B., Canada. His research interests include digital signal processing, speaker recognition, and speech recognition.