Computer Science – Computation and Language
Scientific paper
1997-11-11
Proceedings of ACL-EACL 97, Madrid, pp 452-459, 1997.
Computer Science
Computation and Language
8 pages, LaTeX, 2 PostScript figures, aclap.sty
Scientific paper
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.
No associations
LandOfFree
Approximating Context-Free Grammars with a Finite-State Calculus 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 Approximating Context-Free Grammars with a Finite-State Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximating Context-Free Grammars with a Finite-State Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-152924