W3C home > Mailing lists > Public > www-voice@w3.org > October to December 2001

Acceptance power of Speech Recognition Grammars

From: Konduru, Sudhakara <Sudhakara.Konduru@fmr.com>
Date: Mon, 3 Dec 2001 10:51:36 -0500
Message-ID: <7DEF2916AC51D2118DE800A0C9DD5B5506B4F3DD@msgmro532nts.fmr.com>
To: "'www-voice@w3.org'" <www-voice@w3.org>
Hi,

I was reading specifications for Speech Recognition Grammars, it seems to me
these are Regular Grammars. If this is true, it will accept only subset of
Natural Languages.

Here is the list of Grammars with the acceptance power low to high.

Regular Grammars : Accepts Regular Languages (Pattern Recognition)
Context-Free Grammars : Accepts Context-Free Languages (Computer Languages)
Context-Sensitive Grammars : Accepts Context-Sensitive Languages (Natural
Languages)
Turing Machines : Accepts Recursive and Recursively Enumerable Sets
(Computation)

Is it a limitation on the Speech Recognition Grammars ?

Thanks,
Sudhakar.
Received on Monday, 3 December 2001 10:52:47 GMT

This archive was generated by hypermail 2.2.0+W3C-0.50 : Monday, 30 October 2006 12:48:54 GMT