|
HKUST Institutional Repository >
Electronic and Computer Engineering >
ECE Master Theses >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/1783.1/4574
|
| Title: | A one-pass keyword spotting algorithm using a log likelihood ratio confidence measure |
| Authors: | Lai, Chak Shun |
| Issue Date: | 2000 |
| Abstract: | One common method for keyword spotting in unconstrained speech is based upon a two pass strategy consisting of Viterbi-decoding to detect and segment possible keyword hits, followed by the verification of those hit. In this thesis, we proposed a simple one-pass strategy where computation of the confidence measure is computed simultaneously with a Viterbi like decoding stage for verification purposes. However, backtracking is not required, which when coupled with the need for only a single pass through the utterance significantly reduces the memory requirements of this algorithm. This feature makes it well suit for devices where processing power and memory are limited. Experimental results on spotting days of the week in continuous speech indicate that the proposed algorithm has comparable performance with two pass strategy. |
| Description: | Thesis (M.Phil.)--Hong Kong University of Science and Technology, 2000
46, [42] leaves : ill. ; 30 cm
HKUST Call Number: Thesis ELEC 2000 LaiCS |
| URI: | http://hdl.handle.net/1783.1/4574 |
| Appears in Collections: | ECE Master Theses
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| th_redirect.html | | 0Kb | HTML | View/Open |
|
All items in this Repository are protected by copyright, with all rights reserved.
|
