ASR-complete is, by analogy to NP-completeness in complexity theory, a term to indicate that the difficulty of a computational problem is equivalent to solving the central Automatic Speech Recognition problem, i.e.
The goal of ASR is not necessarily to produce a stream of words, given a speech signal.
"Automatic speech recognition (ASR) is one of the fastest growing and commercially most promising applications of natural language technology.
 See also: Speech recognition, Demon, Natural language understanding, Automatic speech recognition, AI
  
|
RSS
