Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 1
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Cohen, Shay B. and Gildea, Daniel 2016. Parsing Linear Context-Free Rewriting Systems with Fast Matrix Multiplication. Computational Linguistics, p. 1.


Products of weighted logic programs

  • SHAY B. COHEN (a1), ROBERT J. SIMMONS (a1) and NOAH A. SMITH (a1)
  • DOI:
  • Published online: 28 January 2011

Weighted logic programming, a generalization of bottom-up logic programming, is a well-suited framework for specifying dynamic programming algorithms. In this setting, proofs correspond to the algorithm's output space, such as a path through a graph or a grammatical derivation, and are given a real-valued score (often interpreted as a probability) that depends on the real weights of the base axioms used in the proof. The desired output is a function over all possible proofs, such as a sum of scores or an optimal score. We describe the product transformation, which can merge two weighted logic programs into a new one. The resulting program optimizes a product of proof scores from the original programs, constituting a scoring function known in machine learning as a “product of experts.” Through the addition of intuitive constraining side conditions, we show that several important dynamic programming algorithms can be derived by applying product to weighted logic programs corresponding to simpler weighted logic programs. In addition, we show how the computation of Kullback–Leibler divergence, an information-theoretic measure, can be interpreted using product.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

D. Chiang 2007. Hierarchical phrase-based translation. Computational Linguistics 33, 2, 201228.

C. Cortes , M. Mohri , A. Rastogi and M. D. Riley 2006. Efficient computation of the relative entropy of probabilistic automata. In Proc. of LATIN 2006: Theoretical Informatics: 7th Latin American Symposium, José R. Correa , Alejandro Hevia and Marcos Kiwi , Eds. Lecture Notes in Computer Science, vol. 3887. Springer, 323336.

R. Durbin , S. Eddy , A. Krogh and G. Mitchison 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press.

J. Eisner and G. Satta 1999. Efficient parsing for bilexical context-free grammars and head automaton grammars. In Proc. of the 37th Annual Meeting of the Association of Computational Linguistics, Association of Computational Linguistics, 457464.

H. Gaifman 1965. Dependency systems and phrase-structure systems. Information and Control 8, 3, 304337.

D. Hernando , V. Crespi and G. Cybenko 2005. Efficient computation of the hidden Markov model entropy for a given observation sequence. IEEE Transactions on Information Theory 51, 7, 26812685.

G. E. Hinton 2002. Training products of experts by minimizing contrastive divergence. Neural Computation 14, 17711800.

L. Huang and D. Chiang 2005. Better k-best parsing. In Proc. of the 9th International Workshop on Parsing Technology, Association for Computational Linguistics, 5364.

R. Hwa 2004. Sample selection for statistical parsing. Computational Linguistics 30, 3, 253276.

D. Klein and C. D. Manning 2004. Parsing and hypergraphs. New Developments in Parsing Technology, Harry Bunt , John Carroll and Giorgio Satta Eds. Kluwer Academic Publishers, 351372.

S. Kullback and R. A. Leibler 1951. On information and sufficiency. Annals of Mathematical Statistics 22, 7986.

A. Lopez 2009. Translation as weighted deduction. In Proc. of the 12th Conference of the European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, 532540.

D. McAllester 2002. On the complexity analysis of static analyses. Journal of the ACM 49, 4, 512537.

J. A. O'Sullivan 1998. Alternating minimization algorithms: From Blahut-Armijo to expectation-maximization. In Codes, Curves and Signals: Common Threads in Communications, A. Vardy , Ed. Kluwer, 173192.

F. C. N. Pereira and Y. Schabes 1992. Inside–outside reestimation from partially bracketed corpora. In Proc. of the 30th Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, 128135.

A. Pettorossi 1999. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programming 41, 2–3 (December), 197230.

C. Shannon 1948. A mathematical theory of communication. Bell System Technical Journal 27, 379423.

S. M. Shieber , Y. Schabes and F. C. N. Pereira 1995. Principles and implementation of deductive parsing. Journal of Logic Programming 24, 1–2, 336.

K. Sikkel 1997. Parsing Schemata. Springer-Verlag.

R. E. Tarjan 1981. A unified approach to path problems. Journal of the ACM 28, 3, 577593.

D. H. Younger 1967. Recognition and parsing of context-free languages in time n3. Information and Control 10, 2, 189208.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *