کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
380709 | 1437456 | 2013 | 11 صفحه PDF | دانلود رایگان |

• Keyword spotting (KWS) problem is considered as a binary classification problem.
• A framework for KWS with feature extraction and classification parts is proposed.
• Two discriminative features for the feature extraction part are proposed.
• An evolutionary-based classifier is proposed in the classification part.
Keyword spotting refers to detection of all occurrences of any given keyword in input speech utterances. In this paper, we define a keyword spotter as a binary classifier that separates a class of sentences containing a target keyword from a class of sentences which do not include the target keyword. In order to discriminate the mentioned classes, an efficient classification method and a suitable feature set are to be studied. For the classification method, we propose an evolutionary algorithm to train the separating hyper-plane between the two classes. As our discriminative feature set, we propose two confidence measure functions. The first confidence measure function computes the possibility of phonemes presence in the speech frames, and the second one determines the duration of each phoneme. We define these functions based on the acoustic, spectral and statistical features of speech. The results on TIMIT indicate that the proposed evolutionary-based discriminative keyword spotter has lower computational complexity and higher speed in both test and train phases, in comparison to the SVM-based discriminative keyword spotter. Additionally, the proposed system is robust in noisy conditions.
Journal: Engineering Applications of Artificial Intelligence - Volume 26, Issue 7, August 2013, Pages 1660–1670