Practical experiments with regular approximation of context-free languages
<|reference_start|>Practical experiments with regular approximation of context-free languages: 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.<|reference_end|>
@article{nederhof1999practical,
    title={Practical experiments with regular approximation of context-free
  languages},
    author={Mark-Jan Nederhof},
    journal={arXiv preprint arXiv:cs/9910022},
    year={1999},
    archivePrefix={arXiv},
    eprint={cs/9910022},
    primaryClass={cs.CL}
}