Computational Challenges in Parsing by Classification

5Citations
Citations of this article
67Readers
Mendeley users who have this article in their library.

Abstract

This paper presents a discriminative parser that does not use a generative model in any way, yet whose accuracy still surpasses a generative baseline. The parser performs feature selection incrementally during training, as opposed to a priori, which enables it to work well with minimal linguistic cleverness. The main challenge in building this parser was fitting the training data into memory. We introduce gradient sampling, which increased training speed 100-fold. Our implementation is freely available at http://nlp.cs.nyu.edu/parser/.

Cite

CITATION STYLE

APA

Turian, J., & Melamed, I. D. (2006). Computational Challenges in Parsing by Classification. In HLT-NAACL 2006 - Computationally Hard Problems and Joint Inference in Speech and Language Processing, Proceedings of the Workshop (pp. 17–24). Association for Computational Linguistics (ACL). https://doi.org/10.3115/1631828.1631831

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free