Speech understanding and speech translation by maximum a-posteriori semantic decoding

被引:1
作者
Müller, J
Stahl, H
机构
[1] Siemens AG, Dept ICN TR S R2, D-81359 Munich, Germany
[2] Rohde & Schwarz GmbH & Co KG, D-81671 Munich, Germany
来源
ARTIFICIAL INTELLIGENCE IN ENGINEERING | 1999年 / 13卷 / 04期
关键词
speech recognition; speech understanding; speech translation; hidden-Markov-model; semantic decoding; intention decoding; semantic structure;
D O I
10.1016/S0954-1810(99)00010-2
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper describes a domain-limited system for speech understanding as well as for speech translation. An integrated semantic decoder directly converts the preprocessed speech signal into its semantic representation by a maximum a-posteriori classification. With the combination of probabilistic knowledge on acoustic, phonetic, syntactic, and semantic levels, the semantic decoder extracts the most probable meaning of the utterance. No separate speech recognition stage is needed because of the integration of the Viterbi-algorithm (calculating acoustic probabilities by the use of Hidden-Markov-Models) and a probabilistic chart parser (calculating semantic and syntactic probabilities by special models). The semantic structure is introduced as a representation of an utterance's meaning. It can be used as an intermediate level for a succeeding intention decoder(within a speech understanding system for the control of a running application by spoken inputs) as well as an interlingua-level for a succeeding language production unit (within an automatic speech translation system for the creation of spoken output in another language). Following the above principles and using the respective algorithms, speech understanding and speech translating front-ends for the domains 'graphic editor', 'service robot', 'medical image visualisation' and 'scheduling dialogues' could be successfully realised. (C) 1999 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:373 / 384
页数:12
相关论文
共 28 条
[1]  
[Anonymous], P EUR
[2]  
BAUER JG, 1995, P EUR MADR SPAIN, P567
[3]  
BEHAM M, 1991, P EUR GEN IT, P1437
[4]   AN EFFICIENT CONTEXT-FREE PARSING ALGORITHM [J].
EARLEY, J .
COMMUNICATIONS OF THE ACM, 1970, 13 (02) :94-&
[5]  
EBERSBERGER M, 1995, THESIS MUNICH U TECH
[6]  
EBERSBERGER M, 1996, LECT NOTES ARTIF INT, V1137, P61
[7]  
FISCHER C, 1996, P AUT MOB SYST 1996, P248
[8]  
FISCHER C, 1996, P IEEE RSJ INT C INT
[9]  
HARATSIS D, 1998, THESIS MUNICH U TECH
[10]  
HAUGENEDER H, 1993, EINFUHRUNG KUNSTLICH, P372