@inproceedings{ji-etal-2019-graph,
    title = "Graph-based Dependency Parsing with Graph Neural Networks",
    author = "Ji, Tao  and
      Wu, Yuanbin  and
      Lan, Man",
    editor = "Korhonen, Anna  and
      Traum, David  and
      M{\`a}rquez, Llu{\'i}s",
    booktitle = "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
    month = jul,
    year = "2019",
    address = "Florence, Italy",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/iwcs-25-ingestion/P19-1237/",
    doi = "10.18653/v1/P19-1237",
    pages = "2475--2485",
    abstract = "We investigate the problem of efficiently incorporating high-order features into neural graph-based dependency parsing. Instead of explicitly extracting high-order features from intermediate parse trees, we develop a more powerful dependency tree node representation which captures high-order information concisely and efficiently. We use graph neural networks (GNNs) to learn the representations and discuss several new configurations of GNN{'}s updating and aggregation functions. Experiments on PTB show that our parser achieves the best UAS and LAS on PTB (96.0{\%}, 94.3{\%}) among systems without using any external resources."
}