Bi-directional graph search strategies for speech recognition

Computer Speech and Language

Volumn 10, Issue 4, 1996, Pages 295-321

  Li, Z ^a   Boulianne, G ^a   Labute, P ^a   Barszcz, M ^a   Garudadri, H ^a   Kenny, P ^a  

^a INRS EMT   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA STORAGE EQUIPMENT; GRAPHIC METHODS; HEURISTIC METHODS; REAL TIME SYSTEMS; SPEECH ANALYSIS;

ACOUSTIC PHONETIC MODELLING TECHNIQUES; LOOKAHEAD ASSUMPTIONS; MONOTONE GRAPH SEARCH PROCEDURE; WORD GRAPH;

SPEECH RECOGNITION;

EID: 0030259599     PISSN: 08852308     EISSN: None     Source Type: Journal    
DOI: 10.1006/csla.1996.0015     Document Type: Article

References (16)

1. Aubert, X. & Ney, H. (1995). Large vocabulary continuous speech recognition using word graphs. Proceedings of the ICASSP 95, Detroit, MI, U.S.A., pp. 49-52.
2. Bahl, L. R., Jelinek, F. & Mercer, R. L. (1983). A maximum likelihood approach to continuous speech recognition. IEEE Transactions on Pattern Analysis and Machine Intelligence 5, 179-190.
3. Bahl, L., Gopalakrishnan, P. & Mercer, R. (1995). A tree search strategy for large-vocabulary continuous speech recognition. Proceedings of the ICASSP 95, Detroit, MI, U.S.A., pp. 572-575.
4. Kenny, P., Boulianne, G., Garudadri, H., Trudelle, S., Hollan, R., Lennig, M. & O'Shaughnessy, D. (1994b). Experiments in continuous speech recognition using books on tape. Speech Communication 14, 49-60.
5. Kenny, P., Hollan, R., Gupta, V., Lennig, M., Mermelstein, P. & O'Shaughnessy, D. (1993a). A* - admissible heuristics for rapid lexical access. IEEE Transactions on Speech and Audio Processing 1, 49-58.
6. Kenny, P., Labute, P., Li, Z. & O'Shaughnessy, D. (1994a). New graph search techniques for speech recognition. Proceedings of the ICASSP 94, Adelaide, Australia, pp. 553-556.
7. Kenny, P., Labute, P., Li, Z., Hollan, R., Lennig, M. & O'Shaughnessy, D. (1993b). A very fast method for scoring phonetic transcriptions. Proceedings Eurospeech 93, Berlin, Germany, pp. 2117-2120.
8. Kenny, P., Labute, P., Li, Z., Hollan, R., Lennig, M. & O'Shaughnessy, D. (1993c). A new fast match for very large vocabulary continuous speech recognition. ICASSP 93, Minneapolis, MN, U.S.A., pp. 656-659.
9. Laface, P., Vair, C. & Fissore, L. (1995). A fast segmental viterbi algorithm for large vocabulary recognition. Proceedings of the ICASSP 95, Detroit, MI, U.S.A., pp. 560-563.
10. Nilsson, N. (1982). Principles of Artificial Intelligence. Tioga Publishing.
11. Paul, D. (1995). New developments in the Lincoln stack-decoder based large-vocabulary CSR system. Proceedings of the ICASSP 95, Detroit, MI, U.S.A., pp. 45-48.
12. Riccardi, G., Bocchieri, E. & Pieraccini, P. (1995). Non deterministic stochastic language models for speech recognition. Proceedings of the ICASSP 95, Detroit, MI, U.S.A., pp. 237-240.
13. Roberts, F. (1984). Applied Combinations, p. 489. Prentice Hall, Englewood Cliffs, NJ.
14. Schwartz, R. & Austin, S. (1991). A comparison of several approximate algorithms for finding multiple (n-best) sentence hypotheses. Proceedings of the ICASSP 91, Toronto, Canada, pp. 701-704.
15. Soong, F. K. & Huang, E.-F. (1991). A tree-trellis based fast search for finding the n best sentence hypotheses in continuous speech recognition. Proceedings of the ICASSP 91, Toronto, Canada, pp. 705-708.
16. Woodland, P. C., Legetter, C. J., Odell, J. J., Valtchev, V. & Young, S. J. (1995). The 1994 HTK large vocabulary speech recognition system. Proceedings of the ICASSP 95, pp. 73-76.