Viterbi training for PCFGs: Hardness results and competitiveness of uniform initialization

ACL 2010 - 48th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2010, Pages 1502-1511

  Cohen, Shay B ^a   Smith, Noah A ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASSIGNMENT OF; HARDNESS RESULT; LOG LIKELIHOOD; MODEL PARAMETERS; NP-HARD; PROBABILISTIC CONTEXT FREE GRAMMARS; VITERBI;

COMPUTATIONAL LINGUISTICS;

COMPETITION;

EID: 84859976571     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (32)

1. N. Abe and M. Warmuth. 1992. On the computational complexity of approximating distributions by probabilistic automata. Machine Learning, 9(2-3):205-260.
2. S. Abney. 2007. Semisupervised Learning for Computational Linguistics. CRC Press.
3. D. Aloise, A. Deshpande, P. Hansen, and P. Popat. 2009. NP-hardness of Euclidean sum-of-squares clustering. Machine Learning, 75(2):245-248.
4. D. Arthur and S. Vassilvitskii. 2007. k-means++: The advantages of careful seeding. In Proc. of ACMSIAM symposium on Discrete Algorithms.
5. F. Casacuberta and C. de la Higuera. 2000. Computational complexity of problems on probabilistic grammars and transducers. In Proc. of ICGI.
6. E. Charniak. 1997. Statistical parsing with a contextfree grammar and word statistics. In Proc. of AAAI.
7. S. B. Cohen and N. A. Smith. 2009. Shared logistic normal distributions for soft parameter tying in unsupervised grammar induction. In Proc. of HLTNAACL.
8. M. Collins. 2003. Head-driven statistical models for natural language processing. Computational Linguistics, 29(4):589-637.
9. W. H. E. Day. 1983. Computationally difficult parsimony problems in phylogenetic systematics. Journal of Theoretical Biology, 103.
10. J. DeNero and D. Klein. 2008. The complexity of phrase alignment problems. In Proc. of ACL.
11. Y. Freund, H. Seung, E. Shamir, and N. Tishby. 1997. Selective sampling using the query by committee algorithm. Machine Learning, 28(2-3):133-168.
12. S. Goldwater and M. Johnson. 2005. Bias in learning syllable structure. In Proc. of CoNLL.
13. J. Goodman. 1998. Parsing Inside-Out. Ph.D. thesis, Harvard University.
14. U. Grenander. 1967. Syntax-controlled probabilities. Technical report, Brown University, Division of Applied Mathematics.
15. M. Johnson, T. L. Griffiths, and S. Goldwater. 2006. Adaptor grammars: A framework for specifying compositional nonparameteric Bayesian models. In Advances in NIPS.
16. M. Johnson, T. L. Griffiths, and S. Goldwater. 2007. Bayesian inference for PCFGs via Markov chain Monte Carlo. In Proc. of NAACL.
17. D. Klein and C. Manning. 2001. Natural language grammar induction using a constituentcontext model. In Advances in NIPS.
18. K. Knight. 1999. Decoding complexity in wordreplacement translation models. Computational Linguistics, 25(4):607-615.
19. S. P. Lloyd. 1982. Least squares quantization in PCM. In IEEE Transactions on Information Theory.
20. R. B. Lyngsø and C. N. S. Pederson. 2002. The consensus string problem and the complexity of comparing hidden Markov models. Journal of Computing and System Science, 65(3):545-569.
21. M. Mahajan, P. Nimbhorkar, and K. Varadarajan. 2009. The planar k-means problem is NP-hard. In Proc. of International Workshop on Algorithms and Computation.
22. D. McClosky, E. Charniak, and M. Johnson. 2006a. Effective self-training for parsing. In Proc. of HLTNAACL.
23. D. McClosky, E. Charniak, and M. Johnson. 2006b. Reranking and self-training for parser adaptation. In Proc. of COLING-ACL.
24. R. McDonald and G. Satta. 2007. On the complexity of non-projective data-driven dependency parsing. In Proc. of IWPT.
25. R. M. Neal and G. E. Hinton. 1998. A view of the EM algorithm that justifies incremental, sparse, and other variants. In Learning and Graphical Models, pages 355-368. Kluwer Academic Publishers.
26. K. Sima'an. 1996. Computational complexity of probabilistic disambiguation by means of tree-grammars. In In Proc. of COLING.
27. M. Sipser. 2006. Introduction to the Theory of Computation, Second Edition. Thomson Course Technology.
28. N. A. Smith and M. Johnson. 2007. Weighted and probabilistic context-free grammars are equally expressive. Computational Linguistics, 33(4):477-491.
29. V. I. Spitkovsky, H. Alshawi, D. Jurafsky, and C. D. Manning. 2010. Viterbi training improves unsupervised dependency parsing. In Proc. of CoNLL.
30. R. Udupa and K. Maji. 2006. Computational complexity of statistical machine translation. In Proc. of EACL.
31. M. Wang, N. A. Smith, and T. Mitamura. 2007. What is the Jeopardy model? a quasi-synchronous grammar for question answering. In Proc. of EMNLP.
32. C. Yejin and C. Cardie. 2007. Structured local training and biased potential functions for conditional random fields with application to coreference resolution. In Proc. of HLT-NAACL.