.png){kind=icon}
返回
Optimal linguistic decoding is a difficult computational problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0167-8655(99)00045-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
syntactic pattern recognition
speech decoding
optimal search
computational complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
