Cube summing, approximate inference with non-local features, and dynamic programming without semirings

EACL 2009 - 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings

Volumn , Issue , 2009, Pages 318-326

  Gimpel, Kevin ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; GEOMETRY;

APPROXIMATE INFERENCE; DYNAMIC PROGRAMMING ALGORITHM; DYNAMIC PROGRAMMING EQUATIONS; INDEPENDENCE ASSUMPTION; LOCAL FEATURE; NON-LOCAL FEATURES; RESIDUAL QUANTITY; SEMIRINGS;

DYNAMIC PROGRAMMING;

EID: 80053397731     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1609067.1609102     Document Type: Conference Paper

References (33)

1. L. E. Baum, T. Petrie, G. Soules, and N. Weiss. 1970. A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Annals of Mathematical Statistics, 41(1).
2. P. Blunsom and M. Osborne. 2008. Probabilistic inference for machine translation. In Proc. of EMNLP.
3. P. Blunsom, T. Cohn, and M. Osborne. 2008. A discriminative latent variable model for statistical machine translation. In Proc. of ACL.
4. D. Chiang. 2007. Hierarchical phrase-based translation. Computational Linguistics, 33(2): 201-228.
5. W. W. Cohen and V. Carvalho. 2005. Stacked sequential learning. In Proc. of IJCAI.
6. A. Darwiche. 2003. A differential approach to inference in Bayesian networks. Journal of the ACM, 50(3).
7. J. Eisner, E. Goldlust, and N. A. Smith. 2005. Compiling Comp Ling: Practical weighted dynamic programming and the Dyna language. In Proc. of HLT-EMNLP.
8. J. Eisner. 2002. Parameter estimation for probabilistic finite-state transducers. In Proc. of ACL.
9. J. R. Finkel, T. Grenager, and C. D. Manning. 2005. Incorporating non-local information into information extraction systems by gibbs sampling. In Proc. of ACL.
10. J. Goodman. 1998. Parsing inside-out. Ph.D. thesis, Harvard University.
11. J. Goodman. 1999. Semiring parsing. Computational Linguistics, 25(4): 573-605.
12. A. Griewank and G. Corliss. 1991. Automatic Differentiation of Algorithms. SIAM.
13. L. Huang and D. Chiang. 2005. Better k-best parsing. In Proc. of IWPT.
14. L. Huang and D. Chiang. 2007. Forest rescoring: Faster decoding with integrated language models. In Proc. of ACL.
15. L. Huang. 2008. Forest reranking: Discriminative parsing with non-local features. In Proc. of ACL.
16. M. I. Jordan, Z. Ghahramani, T. Jaakkola, and L. Saul. 1999. An introduction to variational methods for graphical models. Machine Learning, 37(2).
17. D. Klein and C. Manning. 2001. Parsing and hypergraphs. In Proc. of IWPT.
18. T. Koo and M. Collins. 2005. Hidden-variable models for discriminative reranking. In Proc. of EMNLP.
19. K. Kurihara and T. Sato. 2006. Variational Bayesian grammar induction for natural language. In Proc. of ICGI.
20. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. of ICML.
21. R. Levy, F. Reali, and T. Griffiths. 2008. Modeling the effects of memory on human online sentence processing with particle filters. In Advances in NIPS.
22. B. T. Lowerre. 1976. The Harpy Speech Recognition System. Ph.D. thesis, Carnegie Mellon University.
23. D. J. C. MacKay. 1997. Ensemble learning for hidden Markov models. Technical report, Cavendish Laboratory, Cambridge.
24. A. F. T. Martins, D. Das, N. A. Smith, and E. P. Xing. 2008. Stacking dependency parsers. In Proc. of EMNLP.
25. R. McDonald and F. Pereira. 2006. Online learning of approximate dependency parsing algorithms. In Proc. of EACL.
26. F. C. N. Pereira and Y. Schabes. 1992. Inside-outside reestimation from partially bracketed corpora. In Proc. of ACL, pages 128-135.
27. D. Roth and W. Yih. 2004. A linear programming formulation for global inference in natural language tasks. In Proc. of CoNLL.
28. S. Shieber, Y. Schabes, and F. Pereira. 1995. Principles and implementation of deductive parsing. Journal of Logic Programming, 24 (1-2): 3-36.
29. D. A. Smith and J. Eisner. 2008. Dependency parsing by belief propagation. In Proc. of EMNLP.
30. N. A. Smith, D. L. Vail, and J. D. Lafferty. 2007. Computationally efficient M-estimation of log-linear structure models. In Proc. of ACL.
31. C. Sutton and A. McCallum. 2004. Collective segmentation and labeling of distant entities in information extraction. In Proc. of ICML Workshop on Statistical Relational Learning and Its Connections to Other Fields.
32. A. J. Viterbi. 1967. Error bounds for convolutional codes and an asymptotically optimal decoding algorithm. IEEE Transactions on Information Processing, 13(2).
33. M. Wang, N. A. Smith, and T. Mitamura. 2007. What is the Jeopardy model? a quasi-synchronous grammar for QA. In Proc. of EMNLP-CoNLL.