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

[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/) / Gosse Bouma

# Gosse Bouma

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

Gosse Bouma wrote 2 of the papers Mova reads, in 2020–2021, most of them on [Universal Dependencies](https://md.mova.elamur.ai/free/en/docs/papers/topics/universal-dependencies/), [Treebanks](https://md.mova.elamur.ai/free/en/docs/papers/topics/treebanks/); often with [Daniel Zeman](https://md.mova.elamur.ai/free/en/docs/papers/authors/daniel-zeman/), [Djamé Seddah](https://md.mova.elamur.ai/free/en/docs/papers/authors/djame-seddah/).

[OpenAlex](https://openalex.org/A5040322057) · [ORCID](https://orcid.org/0000-0003-1106-3181) · [**h-index 30**](https://openalex.org/authors/A5040322057) · [4489 citations](https://openalex.org/authors/A5040322057) · [187 works](https://openalex.org/works?filter=author.id:A5040322057) — 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=Gosse+Bouma) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Gosse+Bouma) · [dblp](https://dblp.org/search?q=Gosse+Bouma) · [ACL Anthology](https://aclanthology.org/search/?q=Gosse+Bouma) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Gosse+Bouma)

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

## Papers

1. **[From Raw Text to Enhanced Universal Dependencies: The Parsing Shared Task at IWPT 2021](https://md.mova.elamur.ai/free/en/docs/papers/ud-2021-bouma-raw-text-enhanced-universal-dependencies/)** *(2021)* The shared task asks systems to parse raw text all the way to Enhanced Universal Dependencies (EUD), the graph layer that adds propagated conjuncts, controlled subjects, relative-clause antecedents, gapping and orphans.
2. **[Overview of the IWPT 2020 Shared Task on Parsing into Enhanced Universal Dependencies](https://md.mova.elamur.ai/free/en/docs/papers/ud-2020-bouma-overview-iwpt-2020-shared-task/)** *(2020)* The overview introduces the task of parsing raw text into enhanced UD graphs, where a word may have several heads, graphs may contain cycles, and empty nodes may appear, for 17 languages.

## Co-authors (2)

- [Daniel Zeman](https://md.mova.elamur.ai/free/en/docs/papers/authors/daniel-zeman/) ×2
- [Djamé Seddah](https://md.mova.elamur.ai/free/en/docs/papers/authors/djame-seddah/) ×2
- [← previous Go Inoue](https://md.mova.elamur.ai/free/en/docs/papers/authors/go-inoue/)
- [next → Greg Durrett](https://md.mova.elamur.ai/free/en/docs/papers/authors/greg-durrett/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)