Journal of Functional Programming
Removing left recursion from context-free grammars
NAACL 2000 Proceedings of the 1st North American chapter of the Association for Computational Linguistics conference
Compilation of unification grammars with compositional semantics to speech recognition packages
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
Practical issues in compiling typed unification grammars for speech recognition
ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Putting Linguistics into Speech Recognition: The Regulus Grammar Compiler (Studies in Computational Linguistics (Stanford, Calif.).)
EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Posters & Demonstrations
EACL '09 Proceedings of the 12th Conference of the European Chapter of the Association for Computational Linguistics: Demonstrations Session
Dialogue system localization with the GF resource grammar library
SLP '07 Proceedings of the Workshop on Grammar-Based Approaches to Spoken Language Processing
PGF: A Portable Run-time Format for Type-theoretical Grammars
Journal of Logic, Language and Information
Hi-index | 0.00 |
This paper describes how grammar-based language models for speech recognition systems can be generated from Grammatical Framework (GF) grammars. Context-free grammars and finite-state models can be generated in several formats: GSL, SRGS, JSGF, and HTK SLF. In addition, semantic interpretation code can be embedded in the generated context-free grammars. This enables rapid development of portable, multilingual and easily modifiable speech recognition applications.