Computer Science – Computation and Language
Scientific paper
1996-03-08
Computer Science
Computation and Language
24 pages, uses psfig.sty; revised and extended version of the 1991 ACL meeting paper with the same title
Scientific paper
Phrase-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.
Pereira Fernando C. N.
Wright Rebecca N.
No associations
LandOfFree
Finite-State Approximation of Phrase-Structure Grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite-State Approximation of Phrase-Structure Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-State Approximation of Phrase-Structure Grammars will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-234729