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

[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/) / Ryan Gabbard

# Ryan Gabbard

2 paper cards in Mova's library · 2006–2008

Ryan Gabbard wrote 2 of the papers Mova reads, in 2006–2008, most of them on [Treebanks](https://md.mova.elamur.ai/free/en/docs/papers/topics/treebanks/); often with [Seth Kulick](https://md.mova.elamur.ai/free/en/docs/papers/authors/seth-kulick/), [Mitchell Marcus](https://md.mova.elamur.ai/free/en/docs/papers/authors/mitchell-marcus/).

[OpenAlex](https://openalex.org/A5102936432) · [ORCID](https://orcid.org/0000-0002-2122-9678) · [**h-index 8**](https://openalex.org/authors/A5102936432) · [304 citations](https://openalex.org/authors/A5102936432) · [20 works](https://openalex.org/works?filter=author.id:A5102936432) — 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=Ryan+Gabbard) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Ryan+Gabbard) · [dblp](https://dblp.org/search?q=Ryan+Gabbard) · [ACL Anthology](https://aclanthology.org/search/?q=Ryan+Gabbard) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Ryan+Gabbard)

Topics: [Treebanks](https://md.mova.elamur.ai/free/en/docs/papers/topics/treebanks/) 2

## Papers

1. **[Construct State Modification in the Arabic Treebank](https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-2008-gabbard-construct-state-modification-arabic-treebank/)** *(2008)* The Arabic Treebank (ATB) marks a construct-state (iDafa) noun phrase as a NOUN with an NP complement, and the NP can nest.
2. **[Fully Parsing the Penn Treebank](https://md.mova.elamur.ai/free/en/docs/papers/bank-2006-gabbard-fully-parsing-penn-treebank/)** *(2006)* The authors build a two-stage parser that recovers full Penn Treebank trees, including function tags and empty categories, which earlier parsers left out.

## Co-authors (2)

- [Seth Kulick](https://md.mova.elamur.ai/free/en/docs/papers/authors/seth-kulick/) ×2
- [Mitchell Marcus](https://md.mova.elamur.ai/free/en/docs/papers/authors/mitchell-marcus/)
- [← previous Ryan Cotterell](https://md.mova.elamur.ai/free/en/docs/papers/authors/ryan-cotterell/)
- [next → Ryan McDonald](https://md.mova.elamur.ai/free/en/docs/papers/authors/ryan-mcdonald/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)