An Effective Neural Network Model for Graph-based Dependency Parsing

  • Pei W
  • Ge T
  • Chang B
  • 86


    Mendeley users who have this article in their library.
  • 15


    Citations of this article.


Most existing graph-based parsing models rely on millions of hand-crafted features, which limits their generalization ability and slows down the parsing speed. In this paper, we propose a general and effective Neural Network model for graph-based dependency parsing. Our model can auto-matically learn high-order feature combi-nations using only atomic features by ex-ploiting a novel activation function tanh-cube. Moreover, we propose a simple yet effective way to utilize phrase-level infor-mation that is expensive to use in conven-tional graph-based parsers. Experiments on the English Penn Treebank show that parsers based on our model perform better than conventional graph-based parsers.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Wenzhe Pei

  • Tao Ge

  • Baobao Chang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free