Practical experiments with regular approximation of context-free languages
| dc.creator | Nederhof, Mark-Jan | |
| dc.date | 1999-10-25 | |
| dc.date.accessioned | 2026-07-07T03:24:26Z | |
| dc.date.available | 2026-07-07T03:24:26Z | |
| dc.description | 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. | |
| dc.description | 28 pages. To appear in Computational Linguistics 26(1), March 2000 | |
| dc.identifier | https://arxiv.org/abs/cs/9910022 | |
| dc.identifier | http://arxiv.org/abs/cs/9910022 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33321 | |
| dc.subject | Computation and Language | |
| dc.subject | F.4.3; F.1.1 | |
| dc.title | Practical experiments with regular approximation of context-free languages | |
| dc.type | text |