文章基本信息

标题：Practical Experiments with Regular Approximation of Context-Free Languages
本地全文：下载
作者：Mark-Jan Nederhof
期刊名称：Computational Linguistics
印刷版ISSN：0891-2017
电子版ISSN：1530-9312
出版年度：2000
卷号：26
期号：1
页码：17-44
DOI：10.1162/089120100561610
语种：English
出版社：MIT Press
摘要：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.