Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2000 | 10.1162/089120100561610 | Clinical Orthopaedics and Related Research |
Keywords | DocType | Volume |
existing literature,context-free grammar,finite automaton,practical experiment,speech recognizer,refined form,original context-free language,different method,spoken-language input,regular approximation,context free language | Journal | 26 |
Issue | ISSN | Citations |
1 | 0891-2017 | 44 |
PageRank | References | Authors |
3.76 | 20 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mark-jan Nederhof | 1 | 387 | 53.30 |
| NederhofMark-Jan | 2 | 84 | 6.71 |