Word graphs: an efficient interface between continuous-speech recognition and language understanding

Authors:
Martin Oerder;Hermann Ney
Affiliations:
Philips GmbH Forschungslaboratorien, Aachen, Germany;Philips GmbH Forschungslaboratorien, Aachen, Germany
Venue:
ICASSP'93 Proceedings of the 1993 IEEE international conference on Acoustics, speech, and signal processing: speech processing - Volume II
Year:
1993

Citing 5
Cited 0

A CSR-NL interface specification version 1.5

HLT '89 Proceedings of the workshop on Speech and Natural Language
A comparison of several approximate algorithms for finding multiple (N-best) sentence hypotheses

ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
A tree-trellis based fast search for finding the N-best sentence hypotheses in continuous speech recognition

ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Integration of speech recognition and natural language processing in the MIT VOYAGER system

ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
Improvements in beam search for 10000-word continuous speech recognition

ICASSP'92 Proceedings of the 1992 IEEE international conference on Acoustics, speech and signal processing - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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, feed-forward 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 to bigram best-sentence recognition. Results on word graph error rates and word graph densities are presented for the ASL benchmark test.