{"version":"1.0","type":"link","title":"ASR-complete - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}