ASR-complete (original) (raw)

About DBpedia

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. Unlike "NP-completeness", this term is typically used informally. Such problems are hypothesised to include: * Spoken natural language understanding * Understanding speech from far-field microphones, i.e. handling the reverbation and background noise

Property Value
dbo: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. Unlike "NP-completeness", this term is typically used informally. Such problems are hypothesised to include: * Spoken natural language understanding * 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. (en)
dbo:wikiPageExternalLink http://www.icsi.berkeley.edu/ftp/global/pub/speech/papers/icassp03meetings.pdf
dbo:wikiPageID 2376785 (xsd:integer)
dbo:wikiPageLength 1168 (xsd:nonNegativeInteger)
dbo:wikiPageRevisionID 1031321782 (xsd:integer)
dbo:wikiPageWikiLink dbr:Natural-language_understanding dbc:Artificial_intelligence dbr:AI-complete dbr:NP-completeness dbr:Spoken_language dbr:Automatic_Speech_Recognition
dcterms:subject dbc:Artificial_intelligence
rdfs: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. Unlike "NP-completeness", this term is typically used informally. Such problems are hypothesised to include: * Spoken natural language understanding * Understanding speech from far-field microphones, i.e. handling the reverbation and background noise (en)
rdfs:label ASR-complete (en)
owl:sameAs freebase:ASR-complete wikidata:ASR-complete https://global.dbpedia.org/id/4JyGZ
prov:wasDerivedFrom wikipedia-en:ASR-complete?oldid=1031321782&ns=0
foaf:isPrimaryTopicOf wikipedia-en:ASR-complete
is dbo:wikiPageWikiLink of dbr:Index_of_robotics_articles dbr:AI-complete
is foaf:primaryTopic of wikipedia-en:ASR-complete