This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Computation of Probabilities for an Island-Driven Parser
September 1991 (vol. 13 no. 9)
pp. 936-950

The authors describe an effort to adapt island-driven parsers to handle stochastic context-free grammars. These grammars could be used as language models (LMs) by a language processor (LP) to computer the probability of a linguistic interpretation. As different islands may compete for growth, it is important to compute the probability that an LM generates a sentence containing islands and gaps between them. Algorithms for computing these probabilities are introduced. The complexity of these algorithms is analyzed both from theoretical and practical points of view. It is shown that the computation of probabilities in the presence of gaps of unknown length requires the impractical solution of a nonlinear system of equations, whereas the computation of probabilities for cases with gaps containing a known number of unknown words has polynomial time complexity and is practically feasible. The use of the results obtained in automatic speech understanding systems is discussed.

[1] A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms. Menlo Park, CA: Addison-Wesley, 1974.
[2] A. V. Aho and J. D. Ullman,The Theory of Parsing, Translation, and Compiling, Vol. 1: Parsing. Englewood Cliffs, NJ: Prentice-Hall, 1972.
[3] J. K. Baker, "Trainable grammars for speech recognition," inProc. Spring Conf. Acoustical Soc. Amer., 1979.
[4] Y. L. Chow and S. Roukos, "Speech understanding using a unification grammar," inProc. IEEE Int. Conf. Acoustic Speech Signal Processing, (Glasgow, Scotland), 1989, pp. 727-731.
[5] A. Corazza, R. De Mori, R. Gretter, and G. Satta, "Partial derivation tree probabilities for theories containing a gap of unknown length: General case," Internal Rep. 1-1991, McGill Univ. Speech Group, 1991.
[6] E. P. Giachin and C. Rullent, "A parallel parser for spoken natural language," inProc. Eleventh Int. Joint Conf. Artificial Intell., (Detroit, MI), 1989, pp. 1537-1542.
[7] R. C. Gonzales and M. G. Thomason,Syntactic Pattern Recognition. Reading, MA: Addison-Wesley, 1978.
[8] M. A. Harrison,Introduction to Formal Language Theory. Reading, MA: Addison-Wesley, 1978.
[9] F. Jelinek, "The development of an experimental discrete dictation recognizer,"Proc. IEEE, vol. 73, pp. 1616-1624, 1985.
[10] F. Jelinek and J. D. Lafferty, "Computation of the probability of initial substring generation by stochastic context free grammars," Internal Rep., Continuous Speech Recognition Group, IBM Research, T. J. Watson Research Center, Yorktown Heights, NY, 1990.
[11] F. Jelinek, J.D. Lafferty, and R.L. Mercer, "Basic method of probabilistic context free grammars," Internal Rep., T. J. Watson Research Center, Yorktown Heights, NY, 1990.
[12] R. Kuhn and R. De Mori, "A cache-based natural language model for speech recognition,"IEEE Trans. Patt. Anal. Machine Intell., vol. 12, pp. 570-583, 1990.
[13] K. Lari and S. J. Young, "The estimation of stochastic context-free grammars using the inside-outside algorithm,"Comput. Speech Language, vol. 4, pp. 35-56, 1990.
[14] R. M. Moore, F. Pereira, and H. Murveit, "Integrating speech and natural language processing," inProc. Speech Natural Language Workshop, (Philadelphia, PA), 1989, pp. 243-247.
[15] O. Stock, R. Falcone, and P. Insinnamo, "Bidirectional chart: A potential technique for parsing spoken natural language sentences,"Comput. Speech Language, vol. 3, pp. 219-223, 1989.
[16] C. S. Wetherell, "Probabilistic languages: A review and some open questions,"Comput. Surveys, vol. 12, pp. 361-379, 1980.
[17] W. A. Woods, "Optimal search strategies for speech understanding control,"Artificial Intell., vol. 18, pp. 295-326, 1982.
[18] W. A. Woods, "Language processing for speech understanding," in F. Fallside and W. A. Woods (Eds.),Computer Speech Processing. Englewood Cliffs, NJ: Prentice-Hall, 1985, pp. 305-334.

Index Terms:
island-driven parser; stochastic context-free grammars; language models; probability; linguistic interpretation; polynomial time complexity; automatic speech understanding; artificial intelligence; computational complexity; context-free grammars; linguistics; natural languages; speech recognition
Citation:
A. Corraza, R. De Mori, R. Gretter, G. Sata, "Computation of Probabilities for an Island-Driven Parser," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 13, no. 9, pp. 936-950, Sept. 1991, doi:10.1109/34.93811
Usage of this product signifies your acceptance of the Terms of Use.