A provably correct learning algorithm for latent-variable PCFGs

52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014 - Proceedings of the Conference

Volumn 1, Issue , 2014, Pages 1052-1061

  Cohen, Shay B ^a   Collins, Michael ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b Department of Earth and Environmental Sciences   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; MODELING LANGUAGES; SAMPLING; TREES (MATHEMATICS);

CO-OCCURRENCE-MATRIX; CONVEX OBJECTIVES; LANGUAGE MODEL; LATENT VARIABLE; MATRIX DECOMPOSITION; PARSE TREES; TRAINING SAMPLE;

LEARNING ALGORITHMS;

EID: 84906923860     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/p14-1099     Document Type: Conference Paper

References (22)

1. A. Anandkumar, R. Ge, D. Hsu, S. M. Kakade, and M. Telgarsky. 2012. Tensor decompositions for learning latent-variable models. arXiv:1210.7559.
2. S. Arora, R. Ge, and A. Moitra. 2012. Learning topic models-going beyond SVD. In Proceedings of FOCS.
3. S. Arora, R. Ge, Y. Halpern, D. M. Mimno, A. Moitra, D. Sontag, Y. Wu, and M. Zhu. 2013. A practical algorithm for topic modeling with provable guarantees. In Proceedings of ICML.
4. R. Bailly, A. Habrar, and F. Denis. 2010. A spectral approach for probabilistic grammatical inference on trees. In Proceedings of ALT.
5. B. Balle, A. Quattoni, and X. Carreras. 2011. A spectral learning algorithm for finite state transducers. In Proceedings of ECML.
6. Y. Bengio, H. Schwenk, J.-S. Senécal, F. Morin, and J.-L. Gauvain. 2006. Neural probabilistic language models. In Innovations in Machine Learning, pages 137-186. Springer.
7. K. L. Clarkson. 2010. Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm. ACM Transactions on Algorithms (TALG), 6(4):63.
8. S. B. Cohen, K. Stratos, M. Collins, D. F. Foster, and L. Ungar. 2012. Spectral learning of latent-variable PCFGs. In Proceedings of ACL.
9. S. B. Cohen, K. Stratos, M. Collins, D. P. Foster, and L. Ungar. 2013. Experiments with spectral learning of latent-variable PCFGs. In Proceedings of NAACL.
10. A. Dempster, N. Laird, and D. Rubin. 1977. Maximum likelihood estimation from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 39:1-38.
11. P. Dhillon, J. Rodu, M. Collins, D. P. Foster, and L. H. Ungar. 2012. Spectral dependency parsing with latent variables. In Proceedings of EMNLP.
12. M. Frank and P. Wolfe. 1956. An algorithm for quadratic programming. Naval research logistics quarterly, 3(1-2):95-110.
13. H. Hotelling. 1936. Relations between two sets of variates. Biometrika, 28(3/4):321-377.
14. D. Hsu, S. M. Kakade, and T. Zhang. 2009. A spectral algorithm for learning hidden Markov models. In Proceedings of COLT.
15. R. Kneser and H. Ney. 1995. Improved backing-off for m-gram language modeling. In Proceedings of ICASSP.
16. E. L. Lehmann and G. Casella. 1998. Theory of Point Estimation (Second edition). Springer.
17. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19:313-330.
18. T. Matsuzaki, Y. Miyao, and J. Tsujii. 2005. Probabilistic CFG with latent annotations. In Proceedings of ACL.
19. A. Parikh, L. Song, and E. P. Xing. 2011. A spectral algorithm for latent tree graphical models. In Proceedings of ICML.
20. S. Petrov, L. Barrett, R. Thibaux, and D. Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In Proceedings of COLING-ACL.
21. L. Saul and F. Pereira. 1997. Aggregate and mixedorder markov models for statistical language processing. In Proceedings of EMNLP.
22. S. Siddiqi, B. Boots, and G. Gordon. 2010. Reducedrank hidden markov models. Journal of Machine Learning Research, 9:741-748.