Matches in DBpedia 2014 for { <http://dbpedia.org/resource/ASR-complete> ?p ?o. }
Showing items 1 to 13 of
13
with 100 items per page.
- ASR-complete abstract "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. recognize and understanding spoken language. Note that unlike NP-completeness, this term is typically used more informally.Such problems are hypothesised to include:Spoken natural language understandingUnderstanding speech from far-field microphones - i.e. handling the reverbation and background noiseThese 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.".
- ASR-complete wikiPageExternalLink icassp03meetings.pdf.
- ASR-complete wikiPageID "2376785".
- ASR-complete wikiPageRevisionID "501562930".
- ASR-complete hasPhotoCollection ASR-complete.
- ASR-complete subject Category:Artificial_intelligence.
- ASR-complete comment "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. recognize and understanding spoken language. Note that unlike NP-completeness, this term is typically used more informally.Such problems are hypothesised to include:Spoken natural language understandingUnderstanding speech from far-field microphones - i.e.".
- ASR-complete label "ASR-complete".
- ASR-complete sameAs m.077l7s.
- ASR-complete sameAs Q4654334.
- ASR-complete sameAs Q4654334.
- ASR-complete wasDerivedFrom ASR-complete?oldid=501562930.
- ASR-complete isPrimaryTopicOf ASR-complete.