Optimal linguistic decoding is a difficult computational problem

被引：5

作者：

Casacuberta, F

de la Higuera, C

机构：

[1] Univ Politecn Valencia, Dept Sistemas Informat & Computac, Valencia 46020, Spain

[2] Univ St Etienne, EURISE, Jean Monnet, France

来源：

PATTERN RECOGNITION LETTERS | 1999年 / 20卷 / 08期

关键词：

syntactic pattern recognition; speech decoding; optimal search; computational complexity;

D O I：

10.1016/S0167-8655(99)00045-8

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The general problem of decoding an acoustic sequence into an optimal word string under the probabilistic framework cannot be solved by an algorithm in polynomial time. This result is achieved by using the Computational Complexity Theory. The main consequence of this result is that in the most successful framework of speech recognition only suboptimal decoding can be achieved. (C) 1999 Elsevier Science B.V. All rights reserved.

引用

页码：813 / 821

页数：9

共 5 条

[1]

Carey M., 1979, COMPUTER INTRACTABIL

[2] Growth transformations for probabilistic functions of stochastic grammars [J].