This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Generalized Queries on Probabilistic Context-Free Grammars
January 1998 (vol. 20 no. 1)
pp. 65-77

Abstract—Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language. Efficient parsing algorithms for answering particular queries about a PCFG (i.e., calculating the probability of a given sentence, or finding the most likely parse) have been developed and applied to a variety of pattern-recognition problems. We extend the class of queries that can be answered in several ways: (1) allowing missing tokens in a sentence or sentence fragment, (2) supporting queries about intermediate structure, such as the presence of particular nonterminals, and (3) flexible conditioning on a variety of types of evidence. Our method works by constructing a Bayesian network to represent the distribution of parse trees induced by a given PCFG. The network structure mirrors that of the chart in a standard parser, and is generated using a similar dynamic-programming approach. We present an algorithm for constructing Bayesian networks from PCFGs, and show how queries or patterns of queries on the network correspond to interesting queries on PCFGs. The network formalism also supports extensions to encode various context sensitivities within the probabilistic dependency structure.

[1] R.C. Gonzalez and M.S. Thomason, Syntactic Pattern Recognition: An Introduction.Reading, Mass.: Addison-Wesley, 1978.
[2] E. Charniak, Statistical Language Learning.Cambridge, Mass.: MIT Press, 1993.
[3] C.S. Wetherell, "Probabilistic Languages: A Review and Some Open Questions," Computing Surveys, vol. 12, no. 4, pp. 361-379, 1980.
[4] P.A. Chou, "Recognition of Equations Using a Two-Dimensional Stochastic Context-Free Grammar," Proc. SPIE: Visual Communications and Image Processing IV, Int'l Soc. Optical Eng., pp. 852-863,Bellingham, Wash., 1989.
[5] H. Ney, "Stochastic Grammars and Pattern Recognition," Speech Recognition and Understanding, P. Laface and R. DeMori, eds., pp. 319-344.Berlin: Springer, 1992.
[6] Y. Sakakibara, M. Brown, R.C. Underwood, I.S. Mian, and D. Haussler, "Stochastic Context-Free Grammars for Modeling RNA," Proc. 27th Hawaii Int'l Conf. System Sciences, pp. 284-293, 1995.
[7] M. Vilain, "Getting Serious About Parsing Plans: A Grammatical Analysis of Plan Recognition," Proc. Eighth Nat'l Conf. Artificial Intelligence, pp. 190-197, 1990.
[8] T. Briscoe and J. Carroll, "Generalized Probabilistic LR Parsing of Natural Language (Corpora) With Unification-Based Grammars," Computational Linguistics, vol. 19, no. 1, pp. 25-59, Mar. 1993.
[9] J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation.Reading, Mass.: Addison-Wesley, 1979.
[10] F. Jelinek, J.D. Lafferty, and R.L. Mercer, "Basic Methods of Probabilistic Context Free Grammars," Speech Recognition and Understanding, P. Laface and R. DeMori, eds., pp. 345-360.Berlin: Springer, 1992.
[11] J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference.San Mateo, Calif.: Morgan Kaufmann, 1987.
[12] R.E. Neapolitan, Probabilistic Reasoning in Expert Systems: Theory and Algorithms.New York: John Wiley and Sons, 1990.
[13] F.V. Jensen, An Introduction to Bayesian Networks.New York: Springer, 1996.
[14] R. Dechter, "Bucket Elimination: A Unifying Framework for Probabilistic Inference," Proc. 12th Conf. Uncertainty in Artificial Intelligence, pp. 211-219,San Francisco, 1996.
[15] E. Charniak and S.E. Shimony, "Cost-Based Abduction and MAP Explanation," Artificial Intelligence, vol. 66, pp. 345-374, 1994.
[16] R. Dechter, "Topological Parameters for Time-Space Tradeoff," Proc. 12th Conf. Uncertainty in Artificial Intelligence, pp. 220-227,San Francisco, 1996.
[17] A. Darwiche and G. Provan, "Query DAGs: A Practical Paradigm for Implementing Belief-Network Inference," J. Artificial Intelligence Research, vol. 6, pp. 147-176, 1997.
[18] E. Charniak and G. Carroll, "Context-Sensitive Statistics for Improved Grammatical Language Models," Proc. 12th Nat'l Conf. Artificial Intelligence, pp. 728-733,Menlo Park, Calif., 1994.
[19] D.V. Pynadath and M.P. Wellman, "Accounting for Context in Plan Recognition, With Application to Traffic Monitoring," Proc. 11th Conf. Uncertainty in Artificial Intelligence, pp. 472-481,San Francisco, 1995.
[20] E. Black, F. Jelinek, J. Lafferty, D.M. Magerman, R. Mercer, and S. Roukos, "Towards History-Based Grammars: Using Richer Models for Probabilistic Parsing," Proc. Fifth DARPA Speech and Natural Language Workshop, M. Marcus, ed., pp. 31-37, Feb. 1992.
[21] D.M. Magerman and M.P. Marcus, "Pearl: A Probabilistic Chart Parser," Proc. Second Int'l Workshop on Parsing Technologies, pp. 193-199, 1991.
[22] D. Koller, D. McAllester, and A. Pfeffer, "Effective Bayesian Inference for Stochastic Programs," Proc. 14th Nat'l Conf. Artificial Intelligence, pp. 740-747,Menlo Park, Calif., 1997.

Index Terms:
Probabilistic context-free grammars, Bayesian networks.
Citation:
David V. Pynadath, Michael P. Wellman, "Generalized Queries on Probabilistic Context-Free Grammars," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 20, no. 1, pp. 65-77, Jan. 1998, doi:10.1109/34.655650
Usage of this product signifies your acceptance of the Terms of Use.