nips nips2008 nips2008-229 nips2008-229-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Jordan L. Boyd-graber, David M. Blei
Abstract: We develop the syntactic topic model (STM), a nonparametric Bayesian model of parsed documents. The STM generates words that are both thematically and syntactically constrained, which combines the semantic insights of topic models with the syntactic information available from parse trees. Each word of a sentence is generated by a distribution that combines document-specific topic weights and parse-tree-specific syntactic transitions. Words are assumed to be generated in an order that respects the parse tree. We derive an approximate posterior inference method based on variational methods for hierarchical Dirichlet processes, and we report qualitative and quantitative results on both synthetic data and hand-parsed documents. 1
[1] Wei, X., B. Croft. LDA- based document models for ad- hoc retrieval. In Proceedings of the ACM SIGIR Conference on Research and Development in Information Retrieval. 2006.
[2] Cai, J. F., W. S. Lee, Y. W. Teh. NUS- ML:Improving word sense disambiguation using topic features. In Proceedings of SemEval- 2007. Association for Computational Linguistics, 2007. 7
[3] Fei-Fei Li, P. Perona. A Bayesian hierarchical model for learning natural scene categories. In CVPR ’05 - Volume 2, pages 524–531. IEEE Computer Society, Washington, DC, USA, 2005.
[4] Marlin, B. Modeling user rating profiles for collaborative filtering. In S. Thrun, L. Saul, B. Sch¨ lkopf, o eds., Advances in Neural Information Processing Systems. MIT Press, Cambridge, MA, 2004.
[5] Griffiths, T., M. Steyvers. Probabilistic topic models. In T. Landauer, D. McNamara, S. Dennis, W. Kintsch, eds., Latent Semantic Analysis: A Road to Meaning. Laurence Erlbaum, 2006.
[6] Pad´ , S., M. Lapata. Dependency-based construction of semantic space models. Computational Linguiso tics, 33(2):161–199, 2007.
[7] Lin, D. An information-theoretic definition of similarity. In Proceedings of International Conference of Machine Learning, pages 296–304. 1998.
[8] Griffiths, T. L., M. Steyvers, D. M. Blei, et al. Integrating topics and syntax. In L. K. Saul, Y. Weiss, L. Bottou, eds., Advances in Neural Information Processing Systems, pages 537–544. MIT Press, Cambridge, MA, 2005.
[9] Gruber, A., M. Rosen-Zvi, Y. Weiss. Hidden topic Markov models. In Proceedings of Artificial Intelligence and Statistics. San Juan, Puerto Rico, 2007.
[10] Marcus, M. P., B. Santorini, M. A. Marcinkiewicz. Building a large annotated corpus of English: The Penn treebank. Computational Linguistics, 19(2):313–330, 1994.
[11] Hinton, G. Products of experts. In Proceedings of the Ninth International Conference on Artificial Neural Networks, pages 1–6. IEEE, Edinburgh, Scotland, 1999.
[12] Tee, Y. W., M. I. Jordan, M. J. Beal, et al. Hierarchical dirichlet processes. Journal of the American Statistical Association, 101(476):1566–1581, 2006.
[13] Blei, D., A. Ng, M. Jordan. Latent Dirichlet allocation. Journal of Machine Learning Research, 3:993– 1022, 2003.
[14] Finkel, J. R., T. Grenager, C. D. Manning. The infinite tree. In Proceedings of Association for Computational Linguistics, pages 272–279. Association for Computational Linguistics, Prague, Czech Republic, 2007.
[15] Jordan, M., Z. Ghahramani, T. S. Jaakkola, et al. An introduction to variational methods for graphical models. Machine Learning, 37(2):183–233, 1999.
[16] Liang, P., S. Petrov, M. Jordan, et al. The infinite PCFG using hierarchical Dirichlet processes. In Proceedings of Emperical Methods in Natural Language Processing, pages 688–697. 2007.
[17] Boyd, S., L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
[18] Johansson, R., P. Nugues. Extended constituent-to-dependency conversion for English. In (NODALIDA). 2007.
[19] Koeling, R., D. McCarthy. Sussx: WSD using automatically acquired predominant senses. In Proceedings of SemEval-2007. Association for Computational Linguistics, 2007.
[20] Boyd-Graber, J., D. Blei. PUTOP: Turning predominant senses into a topic model for WSD. In Proceedings of SemEval-2007. Association for Computational Linguistics, 2007.
[21] McCarthy, D., R. Koeling, J. Weeds, et al. Finding predominant word senses in untagged text. In Proceedings of Association for Computational Linguistics, pages 280–287. Association for Computational Linguistics, 2004.
[22] Collins, M. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589–637, 2003.
[23] Klein, D., C. Manning. Accurate unlexicalized parsing. In Proceedings of Association for Computational Linguistics, pages 423–430. Association for Computational Linguistics, 2003. 8