Practical Experiments with Regular Approximation of Context-Free Languages
Keyword(s):
Several methods are discussed that construct a finite automaton given a context-free grammar, including both methods that lead to subsets and those that lead to supersets of the original context-free language. Some of these methods of regular approximation are new, and some others are presented here in a more refined form with respect to existing literature. Practical experiments with the different methods of regular approximation are performed for spoken-language input: hypotheses from a speech recognizer are filtered through a finite automaton.
Keyword(s):
2009 ◽
Vol 53
(6)
◽
pp. 547-561
◽
2007 ◽
Vol 18
(06)
◽
pp. 1293-1302
◽
Keyword(s):
Keyword(s):
1970 ◽
Vol 16
(2)
◽
pp. 201-202
◽
2014 ◽
Vol 577
◽
pp. 917-920
2011 ◽
Vol 14
◽
pp. 34-71
◽