[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/authors/erhard-hinrichs/)

[home](https://md.mova.elamur.ai/free/en/) / [docs](https://md.mova.elamur.ai/free/en/docs/) / [papers](https://md.mova.elamur.ai/free/en/docs/papers/) / [authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/) / Erhard Hinrichs

# Erhard Hinrichs

3 paper cards in Mova's library · 2012–2017

Erhard Hinrichs wrote 3 of the papers Mova reads, in 2012–2017, most of them on [Dependency parsing](https://md.mova.elamur.ai/free/en/docs/papers/topics/dependency-parsing/), [Treebanks](https://md.mova.elamur.ai/free/en/docs/papers/topics/treebanks/); often with Corina Dima, Daniël de Kok, Erik Schill.

[OpenAlex](https://openalex.org/A5108637841) · [**h-index 22**](https://openalex.org/authors/A5108637841) · [2127 citations](https://openalex.org/authors/A5108637841) · [151 works](https://openalex.org/works?filter=author.id:A5108637841) — openalex, 2026-10-18

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Erhard+Hinrichs) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Erhard+Hinrichs) · [dblp](https://dblp.org/search?q=Erhard+Hinrichs) · [ACL Anthology](https://aclanthology.org/search/?q=Erhard+Hinrichs) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Erhard+Hinrichs)

Topics: [Dependency parsing](https://md.mova.elamur.ai/free/en/docs/papers/topics/dependency-parsing/) 1 · [Treebanks](https://md.mova.elamur.ai/free/en/docs/papers/topics/treebanks/) 1

## Papers

1. **['The parse is darc and full of errors: Universal dependency parsing with transition-based and graph-based algorithms'](https://md.mova.elamur.ai/free/en/docs/papers/ud-2017-yu-parse-is-darc-full-errors/)** *(2017)* The authors built two simple parsers for the CoNLL 2017 UD task: darc, a transition-based arc-standard parser with a swap action and a feedforward network, which was the official system and ranked 12th of 33, and mstnn, a graph-based parser that was not ranked.
2. **[PP Attachment: Where do We Stand?](https://md.mova.elamur.ai/free/en/docs/papers/onto-2017-kok-pp-attachment-where-do-we/)** *(2017)* Prepositional phrase (PP) attachment is one of the most frequent parser errors: in the authors' German parser about 18% of labelled attachment errors are PP attachments.
3. **[Annotating Coordination in the Penn Treebank](https://md.mova.elamur.ai/free/en/docs/papers/maier-2012-annotating-coordination-penn-treebank/)** *(2012)* Coordination matters for many NLP tasks, but large treebanks such as the Penn Treebank do not mark it explicitly: coordinated phrases carry ordinary labels and a comma between conjuncts has the same tag as any other comma, so conjunction-less coordination is nearly invisible.

## Co-authors (9)

- Corina Dima
- Daniël de Kok
- Erik Schill
- Jianqiang Ma
- Julia Krivanek
- Kuan Yu
- Pavel Sofroniev
- [Sandra Kübler](https://md.mova.elamur.ai/free/en/docs/papers/authors/sandra-kubler/)
- Wolfgang Maier
- [← previous Enrico Santus](https://md.mova.elamur.ai/free/en/docs/papers/authors/enrico-santus/)
- [next → Eric Atwell](https://md.mova.elamur.ai/free/en/docs/papers/authors/eric-atwell/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)