Issue No. 01 - January (1998 vol. 20)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/34.655650
<p><b>Abstract</b>—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.</p>
Probabilistic context-free grammars, Bayesian networks.
Michael P. Wellman, David V. Pynadath, "Generalized Queries on Probabilistic Context-Free Grammars", IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 20, no. , pp. 65-77, January 1998, doi:10.1109/34.655650