DYNAMIC-PROGRAMMING PARSING FOR CONTEXT-FREE GRAMMARS IN CONTINUOUS SPEECH RECOGNITION

被引：20

作者：

NEY, H ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

IEEE TRANSACTIONS ON SIGNAL PROCESSING | 1991年 / 39卷 / 02期

关键词：

D O I：

10.1109/78.80816

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper deals with the use of context-free grammars in automatic speech recognition. A dynamic programming algorithm for recognizing and parsing spoken word strings of a context-free grammar is presented. The algorithm can be viewed as a probabilistic extension of the CYK algorithm along with the incorporation of the nonlinear time alignment and word boundary detection. The algorithm provides a closed form solution to the problem of recognizing a word sequence that is formed according to a context-free grammar. The computational complexity of the algorithm is studied. Details of the implementation and experimental tests are described.

引用

页码：336 / 340

页数：5

共 15 条

[1] Baker J. K., 1979, 97 M AC SOC AM, P547
[2] BRIDLE JS, 1982, 1982 P IEEE INT C AC, P899
[3] AN EFFICIENT CONTEXT-FREE PARSING ALGORITHM
EARLEY, J
[J]. COMMUNICATIONS OF THE ACM, 1970, 13 (02) : 94 - &
[4] GRAHAM SL, 1976, 8TH P ANN ACM S THEO, P112
[5] Hopcroft J.E., 1979, INTRO AUTOMATA THEOR
[6] STRUCTURAL METHODS IN AUTOMATIC SPEECH RECOGNITION
LEVINSON, SE
[J]. PROCEEDINGS OF THE IEEE, 1985, 73 (11) : 1625 - 1650
[7] SYNTAX-DIRECTED LEAST ERRORS ANALYSIS FOR CONTEXT-FREE LANGUAGES - PRACTICAL APPROACH
LYON, G
[J]. COMMUNICATIONS OF THE ACM, 1974, 17 (01) : 3 - 14
[8] THE USE OF A ONE-STAGE DYNAMIC-PROGRAMMING ALGORITHM FOR CONNECTED WORD RECOGNITION
NEY, H
[J]. IEEE TRANSACTIONS ON ACOUSTICS SPEECH AND SIGNAL PROCESSING, 1984, 32 (02): : 263 - 271
[9] NEY H, 1982, 3RD P INT C PATT REC, P119
[10] NEY H, 1987, 1987 P IEEE INT C AC

← 1 2 →