ANTNLP at Conll 2018 shared task: A Graph-based Parser for Universal Dependency Parsing

  • Tao Ji
  • , Yufang Liu
  • , Yijun Wang
  • , Yuanbin Wu
  • , Man Lan

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We describe the graph-based dependency parser in our system (AntNLP) submitted to the CoNLL 2018 UD Shared Task. We use bidirectional lstm to get the word representation, then a bi-affine pointer networks to compute scores of candidate dependency edges and the MST algorithm to get the final dependency tree. From the official testing results, our system gets 70.90 LAS F1 score (rank 9/26), 55.92 MLAS (10/26) and 60.91 BLEX (8/26).

Original languageEnglish
Title of host publicationCoNLL 2018 - SIGNLL Conference on Computational Natural Language Learning, Proceedings of the CoNLL 2018 Shared Task
Subtitle of host publicationMultilingual Parsing from Raw Text to Universal Dependencies
PublisherAssociation for Computational Linguistics (ACL)
Pages248-255
Number of pages8
ISBN (Electronic)9781948087827
DOIs
StatePublished - 2018
Event2018 SIGNLL Conference on Computational Natural Language Learning, CoNLL Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies, CoNLL 2018 - Brussels, Belgium
Duration: 31 Oct 20181 Nov 2018

Publication series

NameCoNLL 2018 - SIGNLL Conference on Computational Natural Language Learning, Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies

Conference

Conference2018 SIGNLL Conference on Computational Natural Language Learning, CoNLL Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies, CoNLL 2018
Country/TerritoryBelgium
CityBrussels
Period31/10/181/11/18

Fingerprint

Dive into the research topics of 'ANTNLP at Conll 2018 shared task: A Graph-based Parser for Universal Dependency Parsing'. Together they form a unique fingerprint.

Cite this