@InProceedings{yu-EtAl:2017:K17-3,
  author    = {Yu, Kuan  and  Sofroniev, Pavel  and  Schill, Erik  and  Hinrichs, Erhard},
  title     = {The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms},
  booktitle = {Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies},
  month     = {August},
  year      = {2017},
  address   = {Vancouver, Canada},
  publisher = {Association for Computational Linguistics},
  pages     = {126--133},
  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.},
  url       = {http://www.aclweb.org/anthology/K17-3013}
}