Frequency-domain linear prediction for temporal features

Marios Athineos; Daniel P. W. Ellis

Frequency-domain linear prediction for temporal features
Athineos, Marios
Ellis, Daniel P. W.
Electrical Engineering
Persistent URL:
Book/Journal Title:
ASRU'03: 2003 IEEE Workshop on Automatic Speech Recognition and Understanding : November 30-December [3], 2003
Publisher Location:
Piscataway, N.J.
Current speech recognition systems uniformly employ short-time spectral analysis, usually over windows of 10-30 ms, as the basis for their acoustic representations. Any detail below this timescale is lost, and even temporal structures above this level are usually only weakly represented in the form of deltas etc. We address this limitation by proposing a novel representation of the temporal envelope in different frequency bands by exploring the dual of conventional linear prediction (LPC) when applied in the transform domain. With this technique of frequency-domain linear prediction (FDLP), the 'poles' of the model describe temporal, rather than spectral, peaks. By using analysis windows on the order of hundreds of milliseconds, the procedure automatically decides how to distribute poles to model the temporal structure best within the window. While this approach offers many possibilities for novel speech features, we experiment with one particular form, an index describing the 'sharpness' of individual poles within a window, and show a relatively large word error rate improvement from 4.97% to 3.81% in a recognizer trained on general conversational telephone speech and tested on a small-vocabulary spontaneous numbers task. We analyze this improvement in terms of the confusion matrices and suggest how the newly-modeled fine temporal structure may be helping.
Electrical engineering
Artificial intelligence
Publisher DOI:
Item views
text | xml
Suggested Citation:
Marios Athineos, Daniel P. W. Ellis, , Frequency-domain linear prediction for temporal features, Columbia University Academic Commons, .

Columbia University Libraries | Policies | FAQ