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

[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/) / Johannes Heinecke

# Johannes Heinecke

2 paper cards in Mova's library · 2020–2026

Johannes Heinecke wrote 2 of the papers Mova reads, in 2020–2026, most of them on [Universal Dependencies](https://md.mova.elamur.ai/free/en/docs/papers/topics/universal-dependencies/), [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/topics/machine-translation/).

[OpenAlex](https://openalex.org/A5040554075) · [**h-index 8**](https://openalex.org/authors/A5040554075) · [199 citations](https://openalex.org/authors/A5040554075) · [73 works](https://openalex.org/works?filter=author.id:A5040554075) — 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=Johannes+Heinecke) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Johannes+Heinecke) · [dblp](https://dblp.org/search?q=Johannes+Heinecke) · [ACL Anthology](https://aclanthology.org/search/?q=Johannes+Heinecke) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Johannes+Heinecke)

Topics: [Universal Dependencies](https://md.mova.elamur.ai/free/en/docs/papers/topics/universal-dependencies/) 2 · [Machine translation](https://md.mova.elamur.ai/free/en/docs/papers/topics/machine-translation/) 1

## Papers

1. **[Syntax is the Key to Semantics: Combining Universal Dependencies and Abstract Meaning Representation](https://md.mova.elamur.ai/free/en/docs/papers/heinecke-2026-syntax-is-key-semantics-combining/)** *(2026)* The paper presents PUD-AMR, a new AMR dataset built on the English part of Parallel Universal Dependencies.
2. **[Hybrid Enhanced Universal Dependencies Parsing](https://md.mova.elamur.ai/free/en/docs/papers/ud-2020-heinecke-hybrid-enhanced-universal-dependencies-parsing/)** *(2020)* The system predicts enhanced UD in two steps: a graph-based parser builds the basic tree, then a set of linguistic rules adds the enhanced edges, using only the tree and the UPOS tags, so that the rules are language-independent.
- [← previous Johan Bos](https://md.mova.elamur.ai/free/en/docs/papers/authors/johan-bos/)
- [next → John Carroll](https://md.mova.elamur.ai/free/en/docs/papers/authors/john-carroll/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)