Abstract
This paper describes two strategies, operating at different levels of speech, which exploit special characteristics of the speech understanding task; both involve word islands within an utterance. First, a new upper bound based on the probability of the best possible parse is proposed for scoring partial interpretations of an acoustic signal. Subsequently, the paper describes a method of automating rule discovery for semantic parsers. The rules are incorporated in a structure called a String Classification Tree and involve patterns of key words; they are robust in the presence of production and recognition errors.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. V. Aho and J. D. Ullman. The Theory of Parsing, Translation and Compiling, Vol. 1. Prentice-Hall, Englewood Cliffs, NJ, 1972.
D. Appelt and E. Jackson. SRI International February 1992 ATIS Benchmark Test Results. In Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, Arden Conference Centre, Harriman, NY, Feb. 1992.
J. K. Baker. Trainable Grammars for Speech Recognition. In Proceedings of the Spring Conference of the Acoustical Society of America, 1979.
L. Breiman, J. Friedman, R. Olshen, and C. Stone. Classification and Regression Trees. Wadsworth Inc., 1984.
P. F. Brown, J. Cocke, S. A Della Pietra, V. J. Della Pietra, F. Jelinek, J. D. Lafferty, R. L. Mercer, and P. S. Roossin. A Statistical Approach to Machine Translation. Computational Linguistics, 16(2): 79–85, June 1990.
P. Chou. Optimal Partitioning for classification and regression trees. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(9): 936–950, 1991.
A. Corazza, R. DeMori, R. Gretter, and G. Satta. Compulation of Probabilities for a Stochastic Island-Driven Parser. IEEE Transactions on Pattern Analysis and Machine Intelligence,13(9): 936–950, 1991.
A. Corazza, R. De Mori, and G. Satta. Computation of upper-bounds for stochastic context-free languages. In Proceedings of the Tenth National Conference on Artificial Intelligence, pp. 344–349, San Jose, CA, July 1992.
S. Crawford, R. Fung, L. Appelbaum, and R. Tong. Classification trees for information retrieval. In Proc. 8th International Workshop on Machine Learning, pp. 245–249, Northwestern University, Evanston, IL, USA, 1991.
DARPA. Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, San Mateo, CA, Feb. 1991.
DARPA. Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, San Mateo, CA, Feb. 1992.
K. S. Fu. Syntactic Pattern Recognition and Applications. Prentice-Hall, Englewood Cliffs, NJ, 1982.
S. Gelfand, C. Ravishankar, and E. Delp. An Iterative Growing and Pruning Algorithm for Classification Tree Design. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(6): 163–174, Feb. 1991.
R. C. Gonzales and M. G. Thomason. Syntactic Pattern Recognition. Addison-Weslcy Publishing Company, Reading, MA, 1978.
M. A. Harrison, introduction to Formai Language Theory. Addison-Wesley Publishing Company, Reading, MA, 1978.
E. Jackson and D. Appelt. A Template Matcher for Robust NL Interpretation. In Proceedings of the Speech and Natural Language Workshop, pp. 190–194. Morgan Kaufmann Publishers, Pacific Grove, CA, Feb. 1991.
F. Jelinek and J. D. Lafferty. Computation of the Probability of Initial Substring Generation by Stochastic Context Free Grammars. Computational Linguistics, 17(3): 315–323, 1991.
F. Jelinek, J. D. Lafferty, and R. L. Mercer. Basic Methods of Probabilistic Context Free Grammars. In R. De Mori and P. Laface (eds.), Speech Recognition and Understanding. NATO ASI Series F, Vol. 75, Springer-Verlag, Berlin, 1992.
R. Kuhn and R. De Mori. Learning Speech SSemantics with Keyword Classification Trees. In Proceedings of the IEEE international Conference on Acoustics, Speech and Signal Processing,Vol. II, pp. 55–58, MN, Minnesota, USA, 1993.
K. Lari and S. J. Young. The Estimation of Stochastic Context-Free Grammars using the Inside-Outside Algorithm. Computer Speech and Language, 4(1): 35–56, 1990.
H. C. Lee and K. S. Fu. A Stochastic Syntax Analysis Procedure and Its Application to Pattern Classification. IEEE Transactions on Computers, 4(3): 660–666, 1972.
S. Y. Lu and K. S. Fu. Stochastic Error-Correcting Syntax Analysis for Recognition of Noisy Patterns. IEEE Transactions on Computers, 26(12): 1268–1276, 1977.
J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving, Vol. 1. Addison-Wesley Publishing Company, Reading, MA, 1984.
E. Persoon and K. S. Fu. Sequential Classification of Strings Generated by Stochastic Context-Free Grammars. International Journal of Computer and Information Sciences,4(3): 205–218, 1975.
R. Pieraccini, E. Tzoukermann, and C. H. Lee. Stochastic Representation of Conceptual Structure in the ATIS Task. In Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, Pacific Grove, CA, Feb. 1991.
R. Pieraccini, E. Tzoukermann, et al. Progress Report on the Chronus System. In Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, Arden Conference Centre, Harriman, NY, Feb. 1992.
A. Salomaa. Probabilistic and Weighted Grammars, information and Control, 15: 529–544, 1969.
G. Satta and O. Stock. Bi-Directional Context-Free Grammar Parsing for Natural Language Processing. To appear in: Artificial Intelligence Journal, Elsevier Science Publishers (North-Holland).
S. Scneff. A Relaxation Method for Understanding Spontaneous Speech. In Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, Arden Conference Centre, Harriman, NY, Feb. 1992.
S. Seneff. Robust Parsing for Spoken Language Systems. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 189–192, San Francisco, CA, Mar. 1992.
D. Stallard and R. Bobrów. Fragment Processing in the DELPHI System. In Proceedings of the Speech and Natural Language Workshop. Morgan Kaufmann Publishers, Arden Conference Centre, Harriman, NY, Feb. 1992.
C. S. Wetherell. Probabilistic Languages: a Review and Some Open Questions. Computing Surveys, 12(4): 361–379, 1980.
D. H. Younger. Recognition and Parsing of Context-Free Languages in Time n 3. Information and Control, 10: 189–208, 1967.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Corazza, A., De Mori, R., Gretter, R., Kuhn, R., Satta, G. (1995). Language Models for Automatic Speech Recognition. In: Ayuso, A.J.R., Soler, J.M.L. (eds) Speech Recognition and Coding. NATO ASI Series, vol 147. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-57745-1_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-57745-1_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-63344-7
Online ISBN: 978-3-642-57745-1
eBook Packages: Springer Book Archive