Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Spoken Dialogues with Computers
Spoken Dialogues with Computers
Algorithms for an optimal A* search and linearizing the search in the stack decoder
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
The LIA speech recognition system: from 10xRT to 1xRT
TSD'07 Proceedings of the 10th international conference on Text, speech and dialogue
MACAON: an NLP tool suite for processing word lattices
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies: Systems Demonstrations
Constrained temporal structure for text-dependent speaker verification
Digital Signal Processing
Hi-index | 0.00 |
This paper presents the Speeral continuous speech recognition system developed in the LIA. Speeral uses a modified A* algorithm to find in the search graph the best path taking into account acoustic and linguistic constraints. Rather than words by words, the A* used in Speeral is based on a phoneme lattice previously generated. To avoid the backtraking problems, the system keeps for each frame the deepest nodes of the partially explored lexical tree starting at this frame. If a new hypothesis to explore is ended by a word and the lexicon starting where this word finishes has already been developed, then the next hypothesis will "jump" directly to the deepest nodes. Decoding performances of Speeral are evaluated on the test set of the ARC B1 campaign of AUPELF '97. The experiments on this French database show the efficiency of the search strategy described in this paper.