Presents a fast algorithm for spotting a large number of keywords in unconstrained, continuous speech using an HMM-based continuous speech recognizer. This fast algorithm is based on a two stage scheme. In the first stage, the forward backward search is performed for detecting N most likely common subwords. In the second stage, the tree-trellis search is carried out to determine the optimum keyword by traversing the tree-structural vocabulary in an effective way. Compared with the conventional whole-word based keyword spotting algorithm, the proposed fast algorithm can drastically reduce the computational cost.
展开▼
