Products of weighted logic programs

Theory and Practice of Logic Programming

Volumn 11, Issue 2-3, 2011, Pages 263-296

  Cohen, Shay B ^a   Simmons, Robert J ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

natural language processing; program transformations; weighted logic programming

Indexed keywords

BOTTOM-UP LOGIC PROGRAMMING; DYNAMIC PROGRAMMING ALGORITHM; KULLBACK LEIBLER DIVERGENCE; LOGIC PROGRAMS; NATURAL LANGUAGE PROCESSING; PRODUCT OF EXPERTS; PROGRAM TRANSFORMATIONS; SCORING FUNCTIONS; WEIGHTED LOGIC PROGRAMMING;

COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; LEARNING ALGORITHMS; LOGIC PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS;

DYNAMIC PROGRAMMING;

EID: 79960378651     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068410000529     Document Type: Conference Paper

References (44)

1. Charniak, E., Knight, K. and Yamada, K. 2003. Syntax-based language models for statistical machine translation. In Proc. of the MT Summit IX, Association for Machine Translation in the Americas, Washington, DC.
2. Chiang, D. 2007. Hierarchical phrase-based translation. Computational Linguistics 33, 2, 201-228.
3. Cocke, J. and Schwartz, J. T. 1970. Programming Languages and their Compilers: Preliminary Notes. Courant Institute of Mathematical Sciences, New York University.
4. Cohen, S. B. and Smith, N. A. 2007. Joint morphological and syntactic disambiguation. In Proc. of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, Association for Computational Linguistics, 208-217.
5. Cortes, C., Mohri, M., Rastogi, A. and Riley, M. D. 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, 323-336. (Pubitemid 43986617)
6. Dempster, A., Laird, N. and Rubin, D. 1977. Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B 39, 1-38.
7. Durbin, R., Eddy, S., Krogh, A. and Mitchison, G. 1998. Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press.
8. Eisner, J. 2000. Bilexical grammars and their cubic-time parsing algorithms. In Harry Bunt and Anton Nijholt Eds. Advances in Probabilistic and Other Parsing Technologies, Kluwer Academic Publishers, 29-62.
9. Eisner, J. and Blatz, J. 2007. Program transformations for optimization of parsing algorithms and other weighted logic programs. In Proc. of Formal Grammar, CSLI Publications, 45-85.
10. Eisner, J., Goldlust, E. and Smith, N. A. 2005. Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language. In Proc. of the Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, 281-290.
11. Eisner, J. and Satta, G. 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, 457-464.
12. Felzenszwalb, P. F. and McAllester, D. 2007. The generalized A* architecture. Journal of Artificial Intelligence Research 29, 153-190.
13. Gaifman, H. 1965. Dependency systems and phrase-structure systems. Information and Control 8, 3, 304-337.
14. Goodman, J. 1999. Semiring parsing. Computational Linguistics 25, 4, 573-605.
15. Hernando, D., Crespi, V. and Cybenko, G. 2005. Efficient computation of the hiddenMarkov model entropy for a given observation sequence. IEEE Transactions on Information Theory 51, 7, 2681-2685. (Pubitemid 41136416)
16. Hinton, G. E. 2002. Training products of experts by minimizing contrastive divergence. Neural Computation 14, 1771-1800.
17. Hopcroft, J. E. and Ullman, J. D. 1979. Introduction to Automata Theory, Languages and Computation. Addison-Wesley.
18. Huang, L. and Chiang, D. 2005. Better k-best parsing. In Proc. of the 9th International Workshop on Parsing Technology, Association for Computational Linguistics, 53-64.
19. Hwa, R. 2004. Sample selection for statistical parsing. Computational Linguistics 30, 3, 253-276. (Pubitemid 41461900)
20. Kasami, T. 1965. An Efficient Recognition and Syntax-Analysis Algorithm for Context-Free Languages. Tech. Rep. AFCRL-65-758, Air Force Cambridge Research Lab.
21. Klein, D. and Manning, C. D. 2003. Fast exact inference with a factored model for natural language parsing. In Advances in Neural Information Processing Systems, vol. 15. MIT Press, 3-10.
22. Klein, D. and Manning, C. D. 2004. Parsing and hypergraphs. New Developments in Parsing Technology, Harry Bunt, John Carroll and Giorgio Satta Eds. Kluwer Academic Publishers, 351-372.
23. Koehn, P., Och, F. J. and Marcu, D. 2003. Statistical phrase-based translation. In Proc. of the Human Language Technology Conference and Conference of the North American Chapter of the Association for Computational Linguistics. Association for Computational Linguistics. 48-54.
24. Koller, D. and Friedman, N. 2009. Probabilistic Graphical Models: Principles and Techniques. MIT Press.
25. Kullback, S. and Leibler, R. A. 1951. On information and sufficiency. Annals of Mathematical Statistics 22, 79-86.
26. Liang, P., Klein, D. and Jordan, M. 2008. Agreement-based learning. In Advances in Neural Information Processing Systems 20, J. Platt, D. Koller, Y. Singer and S. Roweis, Eds. MIT Press, Cambridge, MA, 913-920.
27. Lopez, A. 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, 532-540.
28. Manning, C. and Schütze, H. 1999. Foundations of Statistical Natural Language Processing. MIT Press.
29. McAllester, D. 2002. On the complexity analysis of static analyses. Journal of the ACM 49, 4, 512-537.
30. Mohri, M. 1997. Finite-state transducers in language and speech processing. Computational Linguistics 23, 2, 269-311.
31. O'Sullivan, J. A. 1998. Alternating minimization algorithms: From Blahut-Armijo to expectation-maximization. In Codes, Curves and Signals: Common Threads in Communications, A. Vardy, Ed. Kluwer, 173-192.
32. Pereira, F. C. N. and Riley, M. D. 1997. Speech recognition by composition of weighted finite automata. In Finite-State Language Processing, E. Roche and Y. Schabes, Eds. MIT Press, 431-453.
33. Pereira, F. C. N. and Schabes, Y. 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, 128-135.
34. Pettorossi, A. 1999. Synthesis and transformation of logic programs using unfold/fold proofs. Journal of Logic Programming 41, 2-3 (December), 197-230.
35. Pettorossi, A. and Proietti, M. 1994. Transformation of logic programs: Foundations and techniques. Journal of Logic Programming 19, 261-320.
36. Shannon, C. 1948. A mathematical theory of communication. Bell System Technical Journal 27, 379-423.
37. Shieber, S. M., Schabes, Y. and Pereira, F. C. N. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming 24, 1-2, 3-36.
38. Sikkel, K. 1997. Parsing Schemata. Springer-Verlag.
39. Smith, A., Cohn, T. and Osborne, M. 2005. Logarithmic opinion pools for conditional random fields. In Proc. of the 43rd Annual Meeting of the Association for Computational Linguistics, Association for Computational Linguistics, 18-25.
40. Smith, D. A. and Smith, N. A. 2004. Bilingual parsing with factored estimation: Using English to parse Korean. In Proc. of the Conference on Empirical Methods in Natural Language Processing, 49-56.
41. Sutton, C. andMcCallum, A. 2005. Piecewise training of undirected models. In Proc. of the 21st Conference on Uncertainty in Artificial Intelligence, 568-575.
42. Tarjan, R. E. 1981. A unified approach to path problems. Journal of the ACM 28, 3, 577-593.
43. Wu, D. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics 23, 3, 377-404.
44. Younger, D. H. 1967. Recognition and parsing of context-free languages in time n3. Information and Control 10, 2, 189-208.