The infinite tree

ACL 2007 - Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics

Volumn , Issue , 2007, Pages 272-279

  Finkel, Jenny Rose ^a   Grenager, Trond ^a   Manning, Christopher D ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCHING STRUCTURES; DIRICHLET PROCESS; GENERATIVE DEPENDENCY; INDEPENDENCE ASSUMPTION; INFINITE TREES; NON-PARAMETRIC; PART-OF-SPEECH TAGS; SKELETON STRUCTURE; TRAINING DATA; TREEBANKS;

COMPUTATIONAL LINGUISTICS; UNSUPERVISED LEARNING;

FORESTRY;

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

References (18)

1. C. E. Antoniak. 1974. Mixtures of Dirichlet processes with applications to Bayesian nonparametrics. Annals of Statistics, 2:1152-1174.
2. M.J. Beal, Z. Ghahramani, and C.E. Rasmussen. 2002. The infinite hidden Markov model. In Advances in Neural Information Processing Systems, pages 577-584.
3. E. Charniak. 1996. Tree-bank grammars. In AAAI 1996, pages 1031-1036.
4. E. Charniak. 2000. A maximum-entropy-inspired parser. In HLT-NAACL 2000, pages 132-139.
5. M. Collins. 2003. Head-driven statisticalmodels for natural language parsing. Computational Linguistics, 29(4):589-637.
6. T. S. Ferguson. 1973. A Bayesian analysis of some nonparametric problems. Annals of Statistics, 1:209-230.
7. J. Ghosh. 2003. Scalable clustering methods for data mining. In N. Ye, editor, Handbook of Data Mining, chapter 10, pages 247-277. Lawrence Erlbaum Assoc.
8. A. Haghighi and D. Klein. 2006. Prototype-driven learning for sequence models. In HLT-NAACL 2006.
9. M. Johnson, T. Griffiths, and S. Goldwater. 2007. Adaptor grammars: A framework for specifying compositional nonparametric Bayesian models. In NIPS 2007.
10. D. Klein and C. D. Manning. 2003a. Accurate unlexicalized parsing. In ACL 2003.
11. D. Klein and C. D. Manning. 2003b. Factored A* search for models over sequences and trees. In IJCAI 2003.
12. P. Liang, S. Petrov, D. Klein, and M. Jordan. 2007. Nonparametric PCFGs using Dirichlet processes. In EMNLP 2007.
13. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
14. S. Petrov, L. Barrett, R. Thibaux, and D. Klein. 2006. Learning accurate, compact, and interpretable tree annotation. In ACL 44/COLING 21, pages 433-440.
15. J. Pitman. 2002. Poisson-Dirichlet and GEMinvariant distributions for split-and-merge transformations of an interval partition. Combinatorics, Probability and Computing, 11:501-514.
16. N. A. Smith and J. Eisner. 2005. Contrastive estimation: Training log-linear models on unlabeled data. In ACL 2005.
17. Y. W. Teh, M.I. Jordan, M. J. Beal, and D.M. Blei. 2006. Hierarchical Dirichlet processes. Journal of the American Statistical Association, 101:1566-1581.
18. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with support vector machines. In Proceedings of IWPT, pages 195-206.