- Research Article
- Open Access
Query-Driven Strategy for On-the-Fly Term Spotting in Spontaneous Speech
EURASIP Journal on Audio, Speech, and Music Processing volume 2010, Article number: 326578 (2010)
Spoken utterance retrieval was largely studied in the last decades, with the purpose of indexing large audio databases or of detecting keywords in continuous speech streams. While the indexing of closed corpora can be performed via a batch process, on-line spotting systems have to synchronously detect the targeted spoken utterances. We propose a two-level architecture for on-the-fly term spotting. The first level performs a fast detection of the speech segments that probably contain the targeted utterance. The second level refines the detection on the selected segments, by using a speech recognizer based on a query-driven decoding algorithm. Experiments are conducted on both broadcast and spontaneous speech corpora. We investigate the impact of the spontaneity level on system performance. Results show that our method remains effective even if the recognition rates are significantly degraded by disfluencies.
Term detection has been extensively studied in the last decades in the two different contexts of spoken term detection (STD): large speech databases and keyword spotting in continuous speech streams. The first topic recently faced a growing interest, stemming from the critical need of content-based structuring of audio-visual collections. Since the STD task relies on the indexing of the whole speech database, word spotting systems perform a sequential parsing of the speech stream with the purpose of detecting the targeted word sequence. Here, we focus on on-the-fly term spotting, where the detection must be synchronously notified, at the moment where it occurs in the speech stream. This task refers to a usage scenario where early detection is critical, such as supervision and automation of operator-assisted calls [1, 2].
For all these detection tasks, performances reported in the literature are quite good on clean conditions, especially on broadcast news data that were largely used for speech processing system benchmarking [3, 4]. In more difficult conditions, such as noisy or spontaneous speech, performances are dramatically degraded by recognition errors [5–7].
Efficiency and scalability issues are generally considered as critical in detection tasks, due to the size of speech databases or, in the spotting case, due to the need of as soon as possible (ASAP) detection. Some aspects of this problem are commonly encountered in both spotting and large vocabulary continuous speech recognition (LVCSR) contexts, such as fast likelihood computation [8, 9] or fast acoustic matching [10, 11]. On the STD task, the search algorithm operates on data that were indexed by an off-line process. On-the-fly term spotting adds new problems due to on-line processing: the entire speech database is not available for indexing, and the full processing chain, from the signal to the final decision, must be performed as fast as possible in order to limit the delay between the speech utterance and the notification of detection.
Even if using only a real-time recognition system could be envisaged, this approach has two major drawbacks: first, strict pruning schemes have to be used to reach real time, impacting dramatically on the word error rate (WER), especially in adverse acoustic conditions; secondly, automatic speech recognition (ASR) usually relies on closed dictionaries, and some specific modeling strategies have to be used for out-of-vocabulary words (OOV) handling. This lexical coverage problem is a key issue in term detection, with the system effectiveness being highly sensitive to it OOV are frequently meaningful words and may probably be queried by the user. A solution is to map the terms in a sublexical representation allowing for the search of terms without using any recognition lexicon .
Generally, subword-level decoding consists in a fast acoustic matching between the signal and the phonetic or syllabic transcription of the term [13, 14]. Various developments of this idea were evaluated in the past, with the purpose of being able to detect OOV and of improving system robustness . In , the phonetic search integrates the phoneme confusion matrix in order to limit the impact of recognition errors. Other authors combine complementary acoustic scoring methods, for example, Gaussian mixture models (GMMs) and multilayer perceptrons- (MLP-) based estimators [15, 16]. In , the authors propose, in the context of the STD task, to estimate the scores of the OOV by combining the posterior probabilities of their phonetic substrings. Therefore, many of the fast wordspotters are based on off-line phonetic matching. They generally use two models representing, respectively, the targeted word (or term) and the "garbage,'' the latter aiming to "absorb'' all nontargeted utterances [16–18]. These models are built from Hidden Markov Models (HMMs) representing sublexical units, typically phonemes or triphones.
Phonetics-based approaches allow for a high speed spotting and OOV detection, but the system's performance suffers from a lack of linguistic information that help distinguish targeted terms from phonetically close utterances , especially on short phonetic sequences . Therefore, many authors proposed hybrid approaches that combine phonetic search and ASR-based detection in off-line detection systems, in both spotting and STD contexts [20–23].
In this paper, we investigate the use of such a hybrid approach in the specific context of on-the-fly term spotting. We propose a two-level architecture in which the first level performs a phonetic filtering of the speech streams, while the second level involves an open-vocabulary LVCSR system. These two cascaded components are optimized in order to sequentially maximize the recall at the first level, and precision at the second.
At the first level, fast-matching is viewed as a filtering task that aims to accept or reject segments, according to the probability of the targeted terms being inside. Starting from this idea, we present a general scheme in which the term pronunciation graph is mapped into a graph of phonetic filters. The resulting graph is then pruned in order to minimize its complexity, while maximizing its detection capacity.
At the second level, speech segments that passed the first filtering step are processed by an ASR-based term spotter with the purpose of refining the term detection. We propose to improve the detection rate by integrating the query (i.e., the searched word sequence). This integration is based on the driven decoding algorithm (DDA) that was previously proposed by Lecouteux et al. .
The rest of the paper is organized as follows. Section 2 presents the global architecture of our term spotter. Section 3 describes the first level, that aims to identify the speech segments in which the query probably is. We first present a GMM-based approach to acoustic filtering, and we extend the method to neuromimetic filtering. In Section 4, we present the second level, where a query-driven decoding strategy is used for refining the term spotting. In Section 5, we present the experimental framework; results on clean and spontaneous speech are reported and discussed in Section 6. Finally, we conclude the paper and we propose some perspectives.
2. Principle and System Architecture
Starting from a text query composed of a short sequence of words, the term spotting system is supposed to scan a speech stream and to synchronously notify any occurrence of the targeted word sequence.
The global processing chain consists of two stages. In the first stage, the spotter is configured according to the query. This query-dependent adaptation concerns the two main components of the system that are (i) the phonetic spotter and (ii) the query-driven ASR system. Obviously, no information about the speech stream is available at this moment. Then, the detection system is ready to perform the synchronous scanning of the speech stream.
The approach that we propose consists in building, at the first stage, a query-dependent detection system that has to be as accurate as possible, while being able to perform on-the-fly detection. We use a two-level architecture, where the first level performs a fast, but poorly accurate detection, with the detection hypotheses being validated by a more costly detection process at the second level.
Written queries are first phonetically transcribed by using a pronunciation lexicon and a rule-based phonetizer, which produces the word-sequence pronunciation graph. Starting from this phonetic representation, an acoustic filter is built, that is composed from a graph of phonetic filters. Phonetic filters may be based on GMM or MLP. In the following, the full filtering graph is named acoustic filter, while phonetic filters operate at the node level.
At this point, our goal is to maximize the accuracy and the computational efficiency under the constraint of maximal recall rates.
Each speech segment selected by the first level is passed to the second level, as shown in Figure 1. The second level consists of an ASR system based on the driven-decoding algorithm. At this stage, ASR-based processing aims to refine the detection, focusing on precision improvement.
3. Acoustic Filtering
3.1. Query Encoding
The first step consists in transcribing the written query to phonetic strings. All the pronunciation variants of in-vocabulary terms are extracted from a dictionary that has been manually checked, since the OOV are automatically transcribed by using a rule-based phonetization system. Then, all these phonetic transcriptions are compiled in a graph of phonemes where each path represents a pronunciation variant, as illustrated in the Figure 2.
Classical approaches use such representations for spotting words by aligning the graph and the signal in a sliding window, with the global path probability being used for taking the final detection decision. This approach is suboptimal in terms of CPU-resource consumption: evaluation of the full path probability is generally useless as the intermediate scores could be sufficient to prune the low-probability paths. We implement such an as soon as possible cutoff by plugging, to each graph node, a phonetic filter that will be able to stop or to continue the path evaluation process. This filtering process is described in detail in the next two sections, where GMM-based and neuromimetic filters are presented.
Considering this strategy of ASAP cutoff, it is clear that the most discriminative parts of the graph should be evaluated first, with the purpose of reducing the CPU time while preserving the spotting accuracy. Therefore, the graph may be reduced according to both the complexity and the discriminative capacity of its subgraphs. We propose a graph reduction algorithm that is fully described in Section 3.4.
3.2. GMM-Based Phonetic Filters
GMM-based filters use the acoustic models involved in the ASR system. Each filter is associated to an emitting state extracted from the HMM set of the ASR system. The phonetic graph is developed according to the HMM topologies, with each phoneme-dependent node being splitted into a sequence of state-dependent nodes.
The resulting state-dependent filters should be able to stop the graph exploration when observation is out of the model domain. This is achieved by specifying, for each filter, a lower limit for the normalized likelihood :
where is a speech frame of 39 coefficients, composed of 12 PLP coefficients, energy and their first- and second-order derivatives. The Universal Background Model (UBM) is a generic model that represents the speech signal, independently of the phonetic units. Here, UBM is a GMM of 64 Gaussian components, estimated by using the Expectation-Maximization procedure on the training corpus.
The filter-dependent cutoff thresholds are estimated on the training set, by computing the upper bound of values, under the constraint , for all , where is the subset of the training corpus emitted by state .
When the final node of the graph is reached (i.e., all phonetic filters were passed), a last selection rule is applied at the segment level. This rule relies on the full path probabilities of the targeted terms, normalized by the segment duration. We search first, in the training corpus, the lowest probability of the targeted terms. We use this lower bound as a rejection threshold. Therefore, each accepted speech sequence satisfies the constraint
where is the state sequence corresponding to the phonetic string, and is the query-dependent threshold.
3.3. Neuromimetic Phonetic Filters
Discriminative methods for word spotting have been recently investigated in [25–27]. This approach is motivated by the fact that spotting should be stated as a classification task (in rejected/accepted hypotheses), rather than a probability estimation task. The goal of acoustic filtering is to reject nonrelevant segments. Considering that discriminative approaches should be more efficient for segment filtering, we propose the use of multilayer neural networks as phonetic filters.
MLP-based filtering integrates the general scheme that was used with GMM-based filters, with GMM-based phonetic filters being simply substituted for MLP classifiers as probability estimators.
We use one MLP classifier for each of the emitting states that compose an initial context-independent HMM set. We follow the modeling method proposed in [28, 29]. MLP filters operate at the frame level. The input vectors are composed of 351 coefficients, resulting from the concatenation of 9 frames of 39 coefficients each. The latter are classical 12 PLP coefficients, energy, and the first-and second-order derivatives of these 13 components. The hidden layer is composed of 1024 cells. MLPs are trained on a large corpus by using the classical back-propagation learning rule. This training step relies on a state-level segmentation that is performed by using the ASR system and its HMM-based acoustic models.
Each classifier has one output layer that is supposed to provide an estimation of the probability of the frame , given the state . MLP-based phonetic filters are then integrated in the filtering graphs in a similar way to GMM-based filters: a cutoff threshold is associated to each of these neural nets, allowing for the rejection of the detection hypothesis when the output score is low. The values are computed on the training corpus, by estimating the lowest output value obtained by the positive training examples emitted by the states. A segment-level threshold is used for rejecting the detection hypothesis when the full path probability is lower than , with ph denoting the phonetic transcription ph of the query.
This full path probability is estimated by a Viterbi alignment based on neural probability estimators, and normalized according to the size of the considered path.
Finally, the filtering strategy is strictly similar to the one used in the GMM case. MLPs are used as probability estimators, and integrated as phonetic filters with respect to the global filtering scheme initially designed for the GMM-based filtering.
3.4. Smart Phonetic Queries
The basic idea of this mechanism is that some parts of the phonetic query may have a discriminative capacity significantly better than others, for different reasons; first, the less frequent a phoneme-sequence is, the more specific to the targeted term this sequence is. Secondly, according to the phonetic filter performances, the use of partial queries may provide a better complexity/accuracy tradeoff. For example, the search for "olympic games" could be reduced to the phonetic pattern "ympic g…,'' with a significant computational gain and without any significant negative impact on accuracy. It is important to note that the recall rates are not influenced by the query reduction, with an utterance spotted by the full phonetic string being necessarily spotted by any of its substrings.
A similar issue has been addressed in a different context by [6, 30]. The authors proposed to handle OOV queries in an audio search task. They approximated term frequency by backing off to the frequency of the phonetic substrings of the targeted terms. Our idea is to find the optimal substring in terms of both accuracy and complexity, with the purpose of maximizing the former, while minimizing the latter.
At this point, the question is how to find the best subgraph. The first step is to define an objective function that quantifies the complexity/accuracy tradeoff for a given filter associated to a multiword query .
For simplicity, we first linearize the graph by merging competing models into a common phonetic filter. The resulting filter is composed of the cascade of the phonetic filters , corresponding to a phonetic sequence ph and to the associated state sequence . The relevance of is estimated via the objective function that combines a computational cost term with an accuracy index .
We use a complexity index that relies on an estimate of the number of frames that may be submitted to each phonetic filter . The probability of reaching depends on the probability of passing all the previous filters in the cascade of filters. In order to estimate the probability of passing a filter , we associate, to each of them, a random variable that indicates whether a frame passed the filter, or not. Therefore, is set to 1 when the inequality holds, and is set to 0 otherwise. The prior probability of passing is denoted by . Prior probabilities are estimated by counting the number of frames that pass the filter on the training corpus, normalized by the total number of frames.
The prior probability of reaching the phonetic filter is the product of the prior probabilities , of passing the previous filters .
Finally, the computational cost of the cascade of filters is estimated by summing over all prior probabilities of reaching the filters from the cascade
where is a constant computational cost factor that will be set to 1 in our experiments.
The accuracy of the filter can be defined as the prior probability that performs a correct detection. This value depends on two elements. First, the smart phonetic query may match an incorrect word utterance even if the two phonetic strings are identical. For example, the search for "Olympic games'' by using the very short subquery "pic'' will probably return many wrong, but acoustically close, words such "picture.'' Secondly, the phonetic filters may fail, by accepting false utterances.
The first element may be evaluated by estimating, in the training corpus, the probability of the targeted term when the phonetic sequence ph is encountered. This value is computed as follows:
where is the number of utterances of the term in the training corpus, and is the number of utterances of the phonetic sequence ph in the same corpus.
In a similar way, the phonetic filter accuracy represents the prior probability that the filter performs a correct detection. This value is estimated on the training corpus, by counting the number of frames that passed the filter, while actually being emitted by the state .
Finally, the global accuracy of the filter is estimated according to the accuracy of each of its phonetic filters and to the accuracy of the phonetic sequence :
The objective function is defined as
where is a fudge factor empirically determined.
This function is used for subqueries ranking, with the selected smart phonetic query being the one that maximizes :
where are the competing subqueries.
For each query , the subquery selection is achieved by an exhaustive evaluation of all parts of the cascade of filters . Then, the initial full filter is substituted for the subquery , and this reduced filter is used for the acoustic filtering achieved at the first level in our system.
This technique of best phonetic substring search is used for both GMM-based and MLP-based system. Nevertheless, the function relies on the accuracy of the phonetic filters that are dependent on the frame-level probability estimators. Therefore, the smart phonetic query selection process is performed independently for the GMM- and MLP- based filtering methods.
Finally, the tuning of the query-dependent acoustic filters proceeds in the following five steps:
transcription of the writen query,
of the pronunciation variants into a pronunciation graph,
the graph into a graph of states,
of acoustic filters that are attached to the graph nodes,
the graph by searching the best subgraph, according to the accuracy/precision tradeoff.
This process is achieved offline, involving potentially heavy process based on the analysis of the train corpus. It aims to optimize the term-detector efficency, that will be critical during the phase of speech stream scanning.
4. Query-Driven Decoding
The goal of this step is to refine the detection achieved at the first level. Speech segments that passed the filtering process are submitted to the ASR system for a full decoding pass. In order to be sure that the speech segment contains the full targeted speech utterance even if only a part of the phonetic string is spotted (due to smart queries), we enlarge the segment before and after the spotted area. In our experiments, we used an offset of second from the segment borders.
Spotting by using ASR systems is known to be focused on accuracy, since the prior probability of having the targeted terms in a transcription is low. On the other hand, transcription errors may introduce mistakes and lead to misses of correct utterances, especially on large queries: the longer the searched term is, the higher the probability of encountering an erroneous word is. In order to limit this risk, the prior probability of the query is slightly boosted by the driven decoding algorithm (DDA) .
This algorithm aims to align a priori transcripts by using a speech recognition engine. The algorithm proceeds in two steps. First, the provided transcripts and the current hypothesis are synchronized by using an alignment algorithm by minimization of the editing distance between the two word strings and .
Once the hypothesis is aligned with the transcript, the algorithm estimates the matching transcript-to-hypothesis score (denoted ). This score is based on the number of words in the short-term history, which are correctly aligned with the transcript: only three values are used, corresponding, respectively, to a full alignment of the current trigram, a full alignment of the current bi-gram, and an alignment of one word only. Values of are empirically determined, by testing various configurations on a development corpus. Then, trigram probabilities are modified by using the following re-scoring rule:
where is the updated trigram probability of a word knowing the history , and is the initial probability of the trigram.
Here, we used DDA as a postprocessor operating on a segment previously identified as a good candidate by the acoustic filter. The targeted terms are used as a priori transcripts, leading to a slight boosting of the linguistic scores of the hypotheses that match the query.
At this step, OOV probabilities are interpolated by backing off to unknown word probabilities. Unknown word probabilities are estimated classically. We tag as unk all the words in the training set that are out of the recognition vocabulary. Then, unk is viewed as a word and its linguistic probabilities are classically estimated.
Then, a trigram probability of an OOV word can be decomposed according to the conditional probability of the unknown word and the probability of , given :
Here, we use a priorly fixed value for . In the following experiments, this probability is set to .
5. Experimental Framework
5.1. The LIA Broadcast News System
The experiments reported in this paper are carried out by using the LIA broadcast news (BNs) system, which was involved in the ESTER evaluation campaign . This system relies on an decoder with HMM-based context-dependent acoustic models and trigram language models. HMMs are classical three-state left-right models; state tying is achieved by using decision trees. Acoustic vectors are composed of 12 PLP coefficients, the energy, and first- and second-order derivatives of these 13 parameters. Two configurations are involved in the experiments, according to their decoding speed expressed as a real-time factor, that is, the time required by the system to decode one hour of speech signal. We used the real-time (noted 1xRT) and the three times real-time (noted 3xRT) systems in the experiments. The 1xRT system uses acoustic models that have only 24 Gaussian components per state and a strict pruning scheme; whereas the 3xRT system relies on 64 Gaussians per state models.
5.2. The EPAC and ESTER Corpora
ESTER is a large corpus developed in the framework of the ESTER-2005 evaluation campaign. It is composed of 80 hours of French broadcast news. We use these materials as a training set, for both GMM and MLP estimates. Tests are conducted on the EPAC corpus, which is provided by the EPAC project . This project aims to investigate methods for spontaneous speech recognition and understanding. With this purpose, about 11 hours of spontaneous speech were extracted from the nontranscribed ESTER database and manually labeled according to their degree of spontaneity: degree 1 stands for read speech, and degree 10 stands for highly disfluent speech. Here, we consider two classes: medium, corresponding, respectively to degrees 1 to 4, and high, corresponding to degrees 5 and above.
In the sequel, the EPAC corpus is used only for testing. Acoustic filtering and smart querying are calibrated on the ESTER training materials. 270 test queries composed the test set, including 130 in-vocabulary (IV) queries, 70 OOV and 70 hybrid queries, the latter including both known words and OOV. The query size is 1 to 4 words long, with hybrid queries being composed of at least 2 words. The baseline performance of the ASR system in the 1xRT configuration is 40.3% WER, corresponding to WERs of 33.2% and 47.2% on medium and highly spontaneous subsets, respectively. In the 3xRT configuration, these rates decrease to 31.1% and 43.5%.
6.1. Phonetic Filtering Evaluation
The acoustic filtering is evaluated in various configurations. The baseline system consists of a classical phonetic matching, which uses a Viterbi alignment between the phonetic graph and the signal window. The acoustic models are context-independent HMMs trained on ESTER data. We first study the impact of the ASAP pruning technique (A-GMM). Then, smart querying is added to the previous filtering system (A+SR-GMM). Finally, we evaluate MLP-based filtering, with ASAP pruning and smart querying (A + SR + MLP). In Table 1 we show the results on the EPAC spontaneous speech database in terms of recall rates, real-time factor (RT-factor) and filtering rates, with the latter being the cumulated duration of the selected speech segments, normalized by the whole duration of the speech stream.
Results show that the ASAP pruning technique allows for a drastic reduction of the number of accepted speech segments. Smart querying does not impact significantly on the filtering rates, but provides a strong CPU-time saving, with the filtering time being reduced by a factor of two. Comparisons between GMM and MLP filters demonstrate the efficiency of a discriminative approach in such a filtering task. As expected, MLP performs a much more selective filtering of the speech segments (from 37% to 23%), at similar recall rates, in spite of the increase of decoding durations (from 0.03 to 0.05 real time). Nevertheless, the computational cost required for filtering remains at a very low level for the two techniques.
6.2. Evaluation of the Query-Driven Decoding Strategy
Here, the performance of the full system is evaluated. We report baseline results obtained with the LIA real-time ASR system (ASR-1xRT). In order to have a glimpse on the performance of the system without strong constraints on the decoding time, results for the 3xRT system are also reported. For these two systems, no query-dependent mechanisms are used, with the search of terms being directly performed on the outputs of the ASR system.
Then, we estimate the detection rates by using DDA only, without acoustic filtering (DDA-1xRT). Considering the filtering of speech streams, only 37% of the whole speech duration has to be processed by the recognition system (and for MLP).
Methods based on both acoustic filtering and driven decoding are evaluated by using a more accurate ASR system. We take advantage of the filtering by using a 3xRT configuration, with the full process satisfying the real-time constraint.
Performances obtained with the full filtering method based on GMM (GMM+DDA-3xRT) and on MLP (MLP+DDA-3xRT) are reported in Table 2 in terms of the F- measure, which is computed as the harmonic mean of the recall and the precision:
The results show that DDA provides significant improvements in all cases: by using the real-time DDA algorithm, the F- measure is similar to the one obtained with the best ASR-only 3xRT configuration, which is clearly out of the speed requirement for on-the-fly processing. The full two-level system benefits from both acoustic filtering and query-driven decoding; the absolute F- measure gain is of 20%, compared to the ASR-1xRT on IV queries. Compared to the DDA-1xRT system that handles OOV queries, the combination of acoustic filtering and query-driven decoding provides an absolute F- measure gain of about 8%. The boosting of linguistic probabilities seems to be really efficient for ASR-based spotting: on multi-word queries, the prior probability of making a mistake in the whole sequence is high. By integrating the query itself in the recognition process, we provide additional information that tends to limit the errors on the targeted utterance.
The last point is that all DDA-based systems perform better on OOV and hybrid queries. OOV are relatively long, and the size of the phonetic sequences clearly helps in the identification process. Moreover, the use of penalized unknown word probabilities tends to increase the real probability of the targeted terms, which would be very low on OOV, with the recognition lexicon being built by collecting the most frequent words from the training corpus.
6.3. Detection Performance according to the Spontaneity Level
The following experiments investigate the impact of the spontaneity level on the detection rates. We use the classification in medium and high spontaneity level, by relying on our two-level STD system.
The results for the ASR system with query-driven decoding (DDA-1xRT) are reported in Table 3. As expected, the performances are significantly affected by disfluent speech, the F- measure decreasing from 0.76 to 0.63; the recall rates remain stable, but the precision rate decreases by about in absolute value. The acoustic filtering clearly provides a gain in all the conditions, but the more interesting point is that it seems to be highly robust to spontaneous speech: the results reported in Table 4 show that GMM-based filtering leads to similar results on medium and high spontaneity levels in terms of F- measure, with the degradation of the precision rate being compensated by the improvement of the recall rate. The MLP-based system (see Table 5) outperforms the GMM-based system on medium spontaneity degrees (from 0.78 to 0.83), but the F- measure is affected by speech spontaneity. For highly spontaneous speech, GMM- and MLP-based approaches perform similarly.
7. Conclusions and Perspectives
We presented a two-level architecture for on-the-fly term spotting, where the full process is query driven. The first level relies on an optimized representation of the query as a cascade of phonetic filters. The second level performs a query-driven decoding on speech segments that passed the first-level filter. We evaluated the performance of this technique on spontaneous speech. Results demonstrated that ASAP pruning combined with subquery search improves significantly the phonetic matching efficiency, in all test conditions. Moreover, query-driven decoding provides a significant improvement compared to unconstrained decoding. The performances according to the level of spontaneity show that the proposed methods are more robust to disfluencies than ASR-only ones, with respect to the real-time constraint.
Globally, experiments demonstrate the interest of integrating query-dependent information in the detection process, especially with ASR-based spotting. At the acoustic level, this allows for a fast matching that benefits from the particularities of the query phonetic sequence. At the linguistic level, boosting the -gram probabilities of the word sequence improves significantly the performance of ASR-based spotting systems.
Since the proposed architecture is designed for on-the-fly term spotting, some of the techniques herein could be used in the spoken term detection task as well. We now plan to develop our proposal in this way.
Wilpon JG, Rabiner LR, Lee C-H, Goldman ER: Automatic recognition of keywords in unconstrained speech using hidden Markov models. IEEE Transactions on Acoustics, Speech, and Signal Processing 1990, 38(11):1870-1878. 10.1109/29.103088
Wohlford RE, Smith AR, Sambur MR: The enhancement of wordspotting techniques. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '80), April 1980, Denver, Colo, USA 1: 209-212.
Fiscus JG, Ajot J, Garofolo JS, Doddingtion G: Results of the 2006 spoken term detection evaluation. Proceedings of ACM SIGIR Workshop on Searching Spontaneous Conversational, July 2007, Amsterdam, The Netherlands 51-55.
Garofolo JS, Auzanne CGP, Voorhees EM: The TREC spoken document retrieval track: a success story. Proceedings of the 9th Text Retrieval Conference (TREC '00), November 2000, Gaithersburg, Md, USA 8: 16-19.
Pinto J, Szoke I, Prasanna S, Hermansky H: Fast approximate spoken term detection from sequence of phonemes. Proceedings of the ACM SIGIR Workshop on Searching Spontaneous Conversational Speech, July 2008, Singapore IDIAP-RR 08-45
Yu P, Chen K, Ma C, Seide F: Vocabulary-independent indexing of spontaneous speech. IEEE Transactions on Speech and Audio Processing 2005, 13(5):635-643.
Saraclar M: Lattice-based search for spoken utterance retrieval. Proceedings of the Human Language Technologies and North American Association for Computational Linguistics (HLT-NAACL '04), May 2004, Boston, Mass, USA 129-136.
Bocchieri E, Mak B: Subspace distribution clustering for continuous observation density hidden markov models. Proceedings of the European Conference on Speech Communication and Technology (Eurospeech '97), September 1997, Rhodes, Greece 1: 107-110.
Ortmanns S, Firzlaff T, Ney H: Fast likelihood computation methods for continuous mixture densities in large vocabulary speech recognition. Proceedings of the European Conference on Speech Communication and Technology (Eurospeech '97), September 1997, Rhodes, Greece 139-142.
Knill KM, Young SJ: Fast implementation methods for Viterbi-based word-spotting. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '96), May 1996, Atlanta, Ga, USA 1: 522-525.
Cardillo PS, Clements M, Miller MS: Phonetic searching vs. LVCSR: how to find what you really want in audio archives. International Journal of Speech Technology 2002, 5(1):9-22. 10.1023/A:1013670312989
Manos AS: A study on out-of-vocabulary word modelling for a segment-based keyword spotting system, M.S. thesis. Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, Cambridge, Mass, USA; 1996.
Rose R: Definition of subword acoustic units for wordspotting. Proceedings of the 3rd European Conference on Speech Communication and Technology (Eurospeech '93), September 1993, Berlin, Germany 1049-1052.
Lau R, Seneff S: Providing sublexical constraints for word spotting within the angie framework. Proceedings of the European Conference on Speech Communication and Technology (Eurospeech '97), September 1997, Rhodes, Greece 263-266.
Pinto J, Lovitt A, Hermansky H: Exploiting phoneme similarities in hybrid HMM-ANN keyword spotting. Proceedings of the 8th Annual Conference of the International Speech Communication Association (Interspeech '07), August 2007, Antwerp, Belgium 4: 1817-1820.
Bourlard H, D'hoore B, Boite J: Optimizing recognition and rejection performance in wordspotting systems. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '94), April 1994, Adelaide, Australia 1: 373-376.
Manos AS, Zue VW: A segment-based wordspotter using phonetic filler models. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '97), April 1997, Munich, Germany 2: 899-902.
Junkawitsch J, Neubauer L, Hoege H, Ruske G: New keyword spotting algorithm with pre-calculated optimal thresholds. Proceedings of the International Conference on Spoken Language Processing (ICSLP '96), October 1996, Philadelphia, Pa, USA 4: 2067-2070.
Szoke I, Schwarz P, Matĕjka P, et al.: Comparison of keyword spotting approaches for informal continuous speech. Proceedings of the 9th European Conference on Speech Communication and Technology, September 2005, Lisbon, Portugal 633-636.
Szoke I, Fapso M, Burget L, Cernocky J: Hybrid word-subword decoding for spoken term detection. Proceedings of the 31st Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, July 2008, Singapore 42-48.
Logan B, Van Thong JM, Moreno PJ: Approaches to reduce the effects of OOV queries on indexed spoken audio. IEEE Transactions on Multimedia 2005, 7(5):899-906.
Akbacak M, Vergyri D, Stolcke A: Open-vocabulary spoken term detection using graphone-based hybrid recognition systems. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '08), March 2008, Las Vegas, Nev, USA 5240-5243.
Mamou J, Ramabhadran B, Siohan O: Vocabulary independent spoken term detection. In Proceedings of the 30th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR '07), July 2007, Amsterdam, The Netherlands. ACM; 615-622.
Lecouteux B, Linarès G, Bonastre J-F, Nocéra P: Imperfect transcript driven speech recognition. Proceedings of the 9th International Conference on Spoken Language Processing (INTERSPEECH-ICSLP '06), September 2006, Pittsburgh, Pa, USA 4: 1626-1629.
Keshet J, Grangier D, Bengio S: Discriminative keyword spotting. Speech Communication 2009, 51(4):317-329. 10.1016/j.specom.2008.10.002
Ezzat T, Poggio T: Discriminative word-spotting using ordered spectro-temporal patch features. Proceedings of the Workshop on Statistical and Perceptual Audition (SAPA '08), September 2008, Brisbane, Australia 35-40.
Benayed Y, Fohr D, Haton JP, Chottel G: Confidence measures for keyword spotting using suport vector machines. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '03), April 2003, Hong Kong 1: 588-591.
Ellis D, Morgan N: Size matters: an empirical study of neural network training for large vocabulary continuous speech recognition. Proceedings of IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP '99), 1999, Phoenix, Ariz, USA 2: 1013-1016.
Zhu Q, Stolcke A, Chen BY, Morgan N: Using MLP features in SRI's conversational speech recognition system. Proceedings of the 6th Annual Conference of the International Speech Communication Association (Interspeech '05), September 2005, Lisbon, Portugal
Allauzen C, Mohri M, Saraclar M: General indexation of weighted automata application to spoken utterance retrieval. Proceedings of the Workshop on Interdisciplinary Approaches to Speech Indexing and Retrieval (HLT-NAACL '04), May 2004, Boston, Mass, USA 33-40.
Linarès G, Massonié D, Nocéra P, Lévy C: A scalable system for embedded large vocabulary continuous speech recognition. Proceedings of IEEE Workshop on DSP in Mobile and Vehicular Systems, June 2007, Istanbul, Turkey
Dufour R, Jousse V, Estève Y, Béchet F, Linarès G: Spontaneous speech characterization and detection in large audio databases. Proceedings of the 13th International Conference on Speech and Computer (SPECOM '09), June 2009, Saint Petersburg, Russia
About this article
Cite this article
Rouvier, M., Linarès, G. & Lecouteux, B. Query-Driven Strategy for On-the-Fly Term Spotting in Spontaneous Speech. J AUDIO SPEECH MUSIC PROC. 2010, 326578 (2010). https://doi.org/10.1155/2010/326578
- Spontaneous Speech
- Word Error Rate
- Speech Segment
- Automatic Speech Recognition System
- Speech Database