Approximating Context-Free Grammars with a Finite-State Calculus
| dc.creator | Grimley-Evans, Edmund | |
| dc.date | 1997-11-11 | |
| dc.date.accessioned | 2026-07-07T02:36:07Z | |
| dc.date.available | 2026-07-07T02:36:07Z | |
| dc.description | Although adequate models of human language for syntactic analysis and semantic interpretation are of at least context-free complexity, for applications such as speech processing in which speed is important finite-state models are often preferred. These requirements may be reconciled by using the more complex grammar to automatically derive a finite-state approximation which can then be used as a filter to guide speech recognition or to reject many hypotheses at an early stage of processing. A method is presented here for calculating such finite-state approximations from context-free grammars. It is essentially different from the algorithm introduced by Pereira and Wright (1991; 1996), is faster in some cases, and has the advantage of being open-ended and adaptable. | |
| dc.description | 8 pages, LaTeX, 2 PostScript figures, aclap.sty | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9711002 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9711002 | |
| dc.identifier | Proceedings of ACL-EACL 97, Madrid, pp 452-459, 1997. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/15800 | |
| dc.subject | Computation and Language | |
| dc.title | Approximating Context-Free Grammars with a Finite-State Calculus | |
| dc.type | text |