Abstract
We developed two simple systems for dependency parsing: darc, a transition-based parser, and mstnn, a graph-based parser. We tested our systems in the CoNLL 2017 UD Shared Task, with darc being the official system. Darc ranked 12th among 33 systems, just above the baseline. Mstnn had no official ranking, but its main score was above the 27th. In this paper, we describe our two systems, examine their strengths and weaknesses, and discuss the lessons we learned.- Anthology ID:
- K17-3013
- Volume:
- Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies
- Month:
- August
- Year:
- 2017
- Address:
- Vancouver, Canada
- Editors:
- Jan Hajič, Dan Zeman
- Venue:
- CoNLL
- SIG:
- SIGNLL
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 126–133
- Language:
- URL:
- https://aclanthology.org/K17-3013
- DOI:
- 10.18653/v1/K17-3013
- Cite (ACL):
- Kuan Yu, Pavel Sofroniev, Erik Schill, and Erhard Hinrichs. 2017. The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms. In Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies, pages 126–133, Vancouver, Canada. Association for Computational Linguistics.
- Cite (Informal):
- The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms (Yu et al., CoNLL 2017)
- PDF:
- https://preview.aclanthology.org/nschneid-patch-3/K17-3013.pdf
- Data
- Universal Dependencies