Paper: Dynamic Compilation of Weighted Context-Free Grammars

ACL ID P98-2147
Title Dynamic Compilation of Weighted Context-Free Grammars
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1998

Weighted context-free grammars are a conve- nient formalism for representing grammatical constructions and their likelihoods in a variety of language-processing applications. In partic- ular, speech understanding applications require appropriate grammars both to constrain speech recognition and to help extract the meaning of utterances. In many of those applications, the actual languages described are regular, but context-free representations are much more con- cise and easier to create. We describe an effi- cient algorithm for compiling into weighted fi- nite automata an interesting class of weighted context-free grammars that represent regular languages. The resulting automata can then be combined with other speech recognition compo- nents. Our method allows the recognizer to dy- namical...