.png){kind=icon}
Return
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}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
syntactic pattern recognition
speech decoding
optimal search
computational complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
8.0K
Citations:
1.6W
Organization
No organization information available
Cited Papers
No cited papers available