Word graphs: an efficient interface between continuous-speech recognition and language understanding
- 1 January 1993
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (15206149) , 119-122 vol.2
- https://doi.org/10.1109/icassp.1993.319246
Abstract
Word graphs are directed acyclic graphs where each edge is labeled with a word and a score, and each node is labeled with a point in time. Word graphs form an efficient feedforward interface between continuous-speech recognition and linguistic processors. Word graphs with high coverage and modest graph densities can be generated with a computational load comparable with bigram best-sentence recognition. Results on word graph error rates and word graph densities are presented for the ASL (Architecture Speech/Language) benchmark test.Keywords
This publication has 5 references indexed in Scilit:
- Improvements in beam search for 10000-word continuous speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- A comparison of several approximate algorithms for finding multiple (N-best) sentence hypothesesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- Integration of speech recognition and natural language processing in the MIT VOYAGER systemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognitionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- A CSR-NL interface specification version 1.5Published by Association for Computational Linguistics (ACL) ,1989