{{Short description, Type of task difficulty
ASR-complete is, by analogy to "
NP-completeness
In computational complexity theory, NP-complete problems are the hardest of the problems to which ''solutions'' can be verified ''quickly''.
Somewhat more precisely, a problem is NP-complete when:
# It is a decision problem, meaning that for any ...
" in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent to solving the central
automatic speech recognition
Speech recognition is an interdisciplinary subfield of computer science and computational linguistics that develops methodologies and technologies that enable the recognition and translation of spoken language into text by computers. It is also k ...
problem, i.e. recognize and understanding
spoken language
A spoken language is a form of communication produced through articulate sounds or, in some cases, through manual gestures, as opposed to written language. Oral or vocal languages are those produced using the vocal tract, whereas sign languages ar ...
. Unlike "NP-completeness", this term is typically used informally.
Such problems are hypothesised to include:
* Spoken
natural language understanding
Natural language understanding (NLU) or natural language interpretation (NLI) is a subset of natural language processing in artificial intelligence that deals with machine reading comprehension. NLU has been considered an AI-hard problem.
Ther ...
* Understanding speech from far-field microphones, i.e. handling the reverbation and background noise
These problems are easy for humans to do (in fact, they are described directly in terms of imitating humans). Some systems can solve very simple restricted versions of these problems, but none can solve them in their full generality.
See also
*
AI-complete
In the field of artificial intelligence (AI), tasks that are hypothesized to require artificial general intelligence to solve are informally known as AI-complete or AI-hard.Shapiro, Stuart C. (1992)Artificial Intelligence In Stuart C. Shapiro (Ed. ...
References
* Nelson Morgan et al., ''MEETINGS ABOUT MEETINGS: RESEARCH AT ICSI ON SPEECH IN MULTIPARTY CONVERSATIONS'', In: ICASSP 2003, April 6–10, 2003.