Constituent parsing by classification

IWPT 2005 - Proceedings of the 9th International Workshop on Parsing Technologies

Volumn , Issue , 2005, Pages 141-151

  Turian, Joseph ^a   Melamed, I Dan ^a  

^a POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS;

CLASSIFICATION TECHNIQUE; SIMPLE++; STANDARD TESTS; STATE OF THE ART; SUB CLASSIFIERS; TEST SETS;

CLASSIFICATION (OF INFORMATION);

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

References (26)

1. Bikel, D. M. (2004). Intricacies of Collins' parsing model. Computational Linguistics, 30(4), 479-511.
2. Black, E., Abney, S., Flickenger, D., Gdaniec, C., Grishman, R., Harrison, P., et al. (1991). A procedure for quantitatively comparing the syntactic coverage of English grammars. In Speech and Natural Language (pp. 306-311).
3. Charniak, E. (2000). A maximum-entropy-inspired parser. In NAACL (pp. 132-139).
4. Cohen, P. R. (1995). Empirical methods for artificial intelligence. MIT Press.
5. Collins, M. (1999). Head-driven statistical models for natural language parsing. Unpublished doctoral dissertation, UPenn.
6. Collins, M. (2003). Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4), 589-637.
7. Collins, M., & Koo, T. (2005). Discriminative reranking for natural language parsing. Computational Linguistics, 31(1), 25-69.
8. Collins, M., & Roark, B. (2004). Incremental parsing with the perceptron algorithm. In ACL.
9. Collins, M., Schapire, R. E., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48(1-3), 253-285.
10. Henderson, J. (2003). Inducing history representations for broad coverage statistical parsing. In HLT/NAACL.
11. Kalt, T. (2004). Induction of greedy controllers for deterministic treebank parsers. In EMNLP (pp. 17-24).
12. Kearns, M. J., & Mansour, Y. (1999). On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and Systems Sciences, 58(1), 109-128.
13. Klein, D., & Manning, C. D. (2001). Parsing and hypergraphs. In IWPT (pp. 123-134).
14. Klein, D., & Manning, C. D. (2003). Accurate unlexicalized parsing. In ACL (pp. 423-430).
15. Magerman, D. M. (1995). Statistical decision-tree models for parsing. In ACL (pp. 276-283).
16. Marcus, M. P. (1980). Theory of syntactic recognition for natural languages. MIT Press.
17. Och, F. J., & Ney, H. (2002). Discriminative training and maximum entropy models for statistical machine translation. In ACL.
18. Ratnaparkhi, A. (1996). A maximum entropy part-of-speech tagger. In EMNLP (pp. 133-142).
19. Sagae, K., & Lavie, A. (2005). A classifier-based parser with linear run-time complexity. In IWPT.
20. Schapire, R. E., & Singer, Y. (1999). Improved boosting using confidence-rated predictions. Machine Learning, 37(3), 297-336.
21. Taskar, B., Klein, D., Collins, M., Koller, D., & Manning, C. (2004). Max-margin parsing. In EMNLP (pp. 1-8).
22. Taylor, A., Marcus, M., & Santorini, B. (2003). The Penn Treebank: an overview. In A. Abeillé (Ed.), Treebanks: Building and using parsed corpora (pp. 5-22).
23. Toutanova, K., Klein, D., Manning, C. D., & Singer, Y. (2003). Feature-rich part-of-speech tagging with a cyclic dependency network. In HLT/NAACL (pp. 252-259).
24. Wong, A., & Wu, D. (1999). Learning a lightweight robust deterministic parser. In EUROSPEECH.
25. Yamada, H., & Matsumoto, Y. (2003). Statistical dependency analysis with support vector machines. In IWPT.
26. Zhao, S., & Grishman, R. (2005). Extracting relations with integrated information using kernel methods. In ACL.