Boosting-based parse reranking with subtree features

ACL-05 - 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference

Volumn , Issue , 2005, Pages 189-196

  Kudo, Taku ^a,b   Suzuki, Jun ^a   Isozaki, Hideki ^a  

^a Nippon Telegraph and Telephone Corporation   (Japan)

^b Google Inc   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

BOOSTING ALGORITHM; DATA-ORIENTED PARSING; KERNEL METHODS; NEW APPLICATIONS; RE-RANKING; RELEVANT FEATURES; TESTING EFFICIENCY; TREE KERNELS;

TREES (MATHEMATICS);

EID: 84859905769     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1219840.1219864     Document Type: Conference Paper

References (20)

1. Kenji Abe, Shinji Kawasoe, Tatsuya Asai, Hiroki Arimura, and Setsuo Arikawa. 2002. Optimized substructure discovery for semi-structured data. In Proc. of PKDD, pages 1-14.
2. Rens Bod. 1998. Beyond Grammar: An Experience Based Theory of Language. CSLI Publications/Cambridge University Press.
3. Rens Bod. 2001. What is the minimal set of fragments that achieves maximal parse accuracy? In Proc. of ACL, pages 66-73.
4. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proc. of NAACL, pages 132-139.
5. Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures, and the voted perceptron. In Proc. of ACL.
6. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
7. Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. of ICML, pages 175-182.
8. Michael Collins. 2002. Ranking algorithms for named-entity extraction: Boosting and the voted perceptron. In Proc. of ACL, pages 489-496.
9. Yoav Freund, Raj D. Iyer, Robert E. Schapire, and Yoram Singer. 2003. An efficient boosting algorithm for combining preferences. Journal of Machine Learning Research, 4:933-969.
10. Taku Kudo and Yuji Matsumoto. 2001. Chunking with support vector machines. In Proc. of NAACL, pages 192-199.
11. Taku Kudo and Yuji Matsumoto. 2004. A boosting algorithm for classification of semi-structured text. In Proc. of EMNLP, pages 301-308.
12. Simon Perkins, Kevin Lacker, and James Thiler. 2003. Grafting:Fast, incremental feature selection by gradient descent in function space. Journal of Machine Learning Research, 3:1333-1356.
13. Gunnar. Rätsch. 2001. Robust Boosting via Convex Optimization. Ph.D. thesis, Department of Computer Science, University of Potsdam.
14. Robert E. Schapire, Yoav Freund, Peter Bartlett, and Wee Sun Lee. 1997. Boosting the margin: a new explanation for the effectiveness of voting methods. In Proc. of ICML, pages 322-330.
15. Fei Sha and Fernando Pereira. 2003. Shallow parsing with conditional random fields. In Proc. of HLT-NAACL, pages 213-220.
16. Erik F. Tjong Kim Sang and Sabine Buchholz. 2000. Introduction to the CoNLL-2000 Shared Task: Chunking. In Proc. of CoNLL-2000 and LLL-2000, pages 127-132.
17. Vladimir N. Vapnik. 1998. Statistical Learning Theory. Wiley-Interscience.
18. Guizhen Yang. 2004. The complexity of mining maximal frequent itemsets and maximal frequent patterns. In Proc. of SIGKDD.
19. Mohammed Zaki. 2002. Efficiently mining frequent trees in a forest. In Proc. of SIGKDD, pages 71-80.
20. Tong Zhang, Fred Damerau, and David Johnson. 2002. Text chunking based on a generalization of winnow. Journal of Machine Learning Research, 2:615-637. (Pubitemid 135712575)