Efficient grammar processing for a spoken language translation system
- 1 January 1992
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1 (15206149) , 213-216 vol.1
- https://doi.org/10.1109/icassp.1992.225934
Abstract
A problem with many speech understanding systems is that grammars that are more suitable for representing the relation between sentences and their meanings, such as context free grammars (CFGs) and augmented phrase structure grammars (APSGs), are computationally very demanding. On the other hand, finite state grammars are efficient, but cannot represent directly the sentence-meaning relation. The authors describe how speech recognition and language analysis can be tightly coupled by developing an APSG for the analysis component and deriving automatically from it a finite-state approximation that is used as the recognition language model. Using this technique, the authors have built an efficient translation system that is fast compared to others with comparably sized language models.<>Keywords
This publication has 5 references indexed in Scilit:
- A spoken language translator for restricted-domain context-free languagesSpeech Communication, 1992
- Phi DM-Dialog: an experimental speech-to-speech dialog translation systemComputer, 1991
- Finite-state approximation of phrase structure grammarsPublished by Association for Computational Linguistics (ACL) ,1991
- JANUS: a speech-to-speech translation system using connectionist and symbolic processing strategiesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1991
- An efficient context-free parsing algorithmCommunications of the ACM, 1970