Finite-State Approximation of Phrase-Structure Grammars

Simple item page
dc.creatorPereira, Fernando C. N.
dc.creatorWright, Rebecca N.
dc.date1996-03-08
dc.date.accessioned2026-07-07T09:10:07Z
dc.date.available2026-07-07T09:10:07Z
dc.descriptionPhrase-structure grammars are effective models for important syntactic and semantic aspects of natural languages, but can be computationally too demanding for use as language models in real-time speech recognition. Therefore, finite-state models are used instead, even though they lack expressive power. To reconcile those two alternatives, we designed an algorithm to compute finite-state approximations of context-free grammars and context-free-equivalent augmented phrase-structure grammars. The approximation is exact for certain context-free grammars generating regular languages, including all left-linear and right-linear context-free grammars. The algorithm has been used to build finite-state language models for limited-domain speech recognition tasks.
dc.description24 pages, uses psfig.sty; revised and extended version of the 1991 ACL meeting paper with the same title
dc.identifierhttps://arxiv.org/abs/cmp-lg/9603002
dc.identifierhttp://arxiv.org/abs/cmp-lg/9603002
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151266
dc.subjectComputation and Language
dc.titleFinite-State Approximation of Phrase-Structure Grammars
dc.typetext

Files

Collections

arXiv