Phoneme lattice based A* search algorithm for speech recognition

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2448, Issue , 2002, Pages 301-308

  Nocera, Pascal ^a   Linares, Georges ^a   Massonié, Dominique ^a   Lefort, Loïc ^a  

^a LIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BEST PATHS; CONTINUOUS SPEECH; DECODING PERFORMANCE; LATTICE-BASED; LINGUISTIC CONSTRAINTS; MODIFIED A; SEARCH ALGORITHMS; SEARCH STRATEGIES;

CONTINUOUS SPEECH RECOGNITION;

EID: 84942935428     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46154-x_41     Document Type: Conference Paper

References (6)

1. R. De Mori, “Spoken dialogues with computers,” 1997.
2. J. Pearl, “Heuristics: Intelligent search strategies for computer problem solving,” 1984.
3. H.-W. Hon M.-Y. Hwang K.-F. Lee R. Rosenfeld X. Huang F. Alleva, “The SPHINX II speech recognition system: An overview,” Computer Speech and Language, Vol. 7, No. 2, pp. 137–148, 1993.
4. D.B. Paul, “Algorithms for an optimal A* search and linearizing the search in the stack decoder,” ICASSP 91, pp. 693–696, 1991.
5. J. Dolmazon F. Bimbot G. Adda J. Caerou J. Zeiliger, M. Adda-Decker, “Première campagne AUPELF d’évaluation des systèmes de Dictée Vocale,” “Ressources et évaluation en ingénierie des langues,”, pp. 279–307, 2000.
6. Matrouf, O. Bellot, P. Nocera, J.-F. Bonastre, G. Linares, “A posteriori and a priori transformations for speaker adaptation in large vocabulary speech recognition systems,” EuroSpeech 2001, Aalborg.