Iterative posteriorbased keyword spotting without filler models
| Venue: | In Proceedings of the IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing |
| Citations: | 5 - 2 self |
BibTeX
@INPROCEEDINGS{Silaghi_iterativeposteriorbased,
author = {Marius-călin Silaghi and Hervé Bourlard},
title = {Iterative posteriorbased keyword spotting without filler models},
booktitle = {In Proceedings of the IEEE Intl. Conf. on Acoustics, Speech, and Signal Processing},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This paper addresses the problem of detecting keywords in unconstrained speech without explicit modeling of nonkeyword segments. The proposed algorithm is based on recent developments in confidence measures using local posterior probabilities, and searches for the segment maximizing the average observation posterior 1 along the most likely path in the hypothesized keyword model. 2 As known, this approach (sometimes referred to as sliding model method) requires a relaxation of the begin/endpoints of the Viterbi matching, as well as a time normalization of the resulting score, making dynamic programming sub-optimal or more complex (more computation and/or more memory). We present here an alternative (quite simple and efficient) solution to this problem, using an iterative form of Viterbi decoding algorithm, but which does not require scoring for all possible begin/endpoints. Convergence proof of this algorithm is available [8]. Results obtained with this method on 100 keywords chosen at random from the BREF database [5] are reported. 1.
