Processing self corrections in a speech to speech system

Authors:
Jörg Spilker;Martin Klarner;Günther Görz
Affiliations:
University of Erlangen-Nuremberg-Computer Science Institute, IMMD 8 - Tennenlohe, Germany;University of Erlangen-Nuremberg-Computer Science Institute, IMMD 8 - Tennenlohe, Germany;University of Erlangen-Nuremberg-Computer Science Institute, IMMD 8 - Tennenlohe, Germany
Venue:
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2
Year:
2000

Citing 6
Cited 0

A statistical approach to machine translation

Computational Linguistics
Speech repairs, intonational boundaries and discourse markers: modeling speakers' utterances in spoken dialog

Speech repairs, intonational boundaries and discourse markers: modeling speakers' utterances in spoken dialog
M = syntax + prosody: a syntactic prosodic labelling scheme for large spontaneous speech databases

Speech Communication
Deterministic parsing of syntactic non-fluencies

ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
A speech-first model for repair detection and correction

ACL '93 Proceedings of the 31st annual meeting on Association for Computational Linguistics
Integrating multiple knowledge sources for detection and correction of repairs in human-computer dialog

ACL '92 Proceedings of the 30th annual meeting on Association for Computational Linguistics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Speech repairs occur often in spontaneous spoken dialogues. The ability to detect and correct those repairs is necessary for any spoken language system. We present a framework to detect and correct speech repairs where all relevant levels of information, i. e., acoustics, lexis, syntax and semantics can be integrated. The basic idea is to reduce the search space for repairs as soon as possible by cascading filters that involve more and more features. At first an acoustic module generates hypotheses about the existence of a repair. Second a stochastic model suggests a correction for every hypothesis. Well scored corrections are inserted as new paths in the word lattice. Finally a lattice parser decides on accepting the repair.