By Topic

Improving the performance of a keyword spotting system by using support vector machines

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

4 Author(s)
Y. Benayed ; LORIA-CNRS/ INRIA Lorraine, Vandoeuvre, France ; D. Fohr ; J. P. Haton ; G. Chollet

Support vector machines (SVM) represent a new approach to pattern classification developed from the theory of structural risk minimisation. In this paper, we propose an investigation into the application of SVM to the confidence measurement problem in speech recognition. Confidence measures are computed using the phone level information provided by a hidden Markov model (HMM) based speech recognizer. We use three kinds of average techniques as arithmetic, geometric and harmonic averages in order to compute a confidence measure for each word. The acceptance/rejection decision for a given word is based on the confidence feature vector which is processed by a SVM classifier. The performance of the proposed SVM classifier is compared with methods based on the averaging of phone confidence measures.

Published in:

Automatic Speech Recognition and Understanding, 2003. ASRU '03. 2003 IEEE Workshop on

Date of Conference:

30 Nov.-3 Dec. 2003