A Fast and Accurate Dependency Parser using Neural Networks

Almost all current dependency parsers classify based on millions of sparse indicator features. Not only do these features generalize poorly, but the cost of feature computation restricts parsing speed significantly. In this work, we propose a novel way of learning a neural network classifier for use in a greedy, transition-based dependency parser. Because this classifier learns and uses just a small number of dense features, it can work very fast, while achieving an about 2% improvement in unlabeled and labeled attachment scores on both English and Chinese datasets. Concretely, our parser is able to parse more than 1000 sentences per second at 92.2% unlabeled attachment score on the English Penn Treebank.

• DA
  Defense Advanced Research Projects Agency

  Awards: FA8750, FA8650-10-C-7020
• DT
  Defense Threat Reduction Agency
• AR
  Advanced Research Projects Agency
• AF
  Air Force Research Laboratory