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

[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/) / Fernando Pereira

# Fernando Pereira

4 paper cards in Mova's library · 2005–2007

Fernando Pereira wrote 4 of the papers Mova reads, in 2005–2007, 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 [Ryan McDonald](https://md.mova.elamur.ai/free/en/docs/papers/authors/ryan-mcdonald/), [Jan Hajič](https://md.mova.elamur.ai/free/en/docs/papers/authors/jan-hajic/), João Graça.

[OpenAlex](https://openalex.org/A5044708805) · [ORCID](https://orcid.org/0000-0001-6100-947X) · [**h-index 74**](https://openalex.org/authors/A5044708805) · [31522 citations](https://openalex.org/authors/A5044708805) · [529 works](https://openalex.org/works?filter=author.id:A5044708805) — 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=Fernando+Pereira) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Fernando+Pereira) · [dblp](https://dblp.org/search?q=Fernando+Pereira) · [ACL Anthology](https://aclanthology.org/search/?q=Fernando+Pereira) · [ORCID](https://orcid.org/orcid-search/search?searchQuery=Fernando+Pereira)

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

## Papers

1. **[Frustratingly Hard Domain Adaptation for Dependency Parsing](https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-2007-dredze-frustratingly-hard-domain-adaptation-dependency/)** *(2007)* The authors report their entry to the 2007 CoNLL shared task on domain adaptation, where parsers had to adapt to new domains without labelled target data.
2. **[Online Learning of Approximate Dependency Parsing Algorithms](https://md.mova.elamur.ai/free/en/docs/papers/continual-2006-mcdonald-online-learning-approximate-dependency-parsing/)** *(2006)* The maximum spanning tree framework scores a tree as a sum of arc scores, which cannot see neighbouring decisions.
3. **[Online Large-Margin Training of Dependency Parsers](https://md.mova.elamur.ai/free/en/docs/papers/narrative-2005-mcdonald-online-large-margin-training-dependency/)** *(2005)* The paper trains a linear, edge-scored dependency parser with online MIRA, a margin-based update that changes the weights as little as possible while the correct tree beats the k best wrong trees by a loss-dependent margin.
4. **[Non-Projective Dependency Parsing using Spanning Tree Algorithms](https://md.mova.elamur.ai/free/en/docs/papers/narrative-2005-mcdonald-non-projective-dependency-parsing-spanning/)** *(2005)* The paper casts weighted dependency parsing as a search for maximum spanning trees in a directed graph. Eisner's algorithm covers all projective trees in O(n^3), and the Chu-Liu-Edmonds algorithm covers non-projective trees in O(n^2), with the same edge scores. The scores are trained with online large-margin learning…

## Co-authors (9)

- [Ryan McDonald](https://md.mova.elamur.ai/free/en/docs/papers/authors/ryan-mcdonald/) ×3
- [Jan Hajič](https://md.mova.elamur.ai/free/en/docs/papers/authors/jan-hajic/)
- João Graça
- John Blitzer
- Kiril Ribarov
- Koby Crammer
- Kuzman Ganchev
- Mark Dredze
- Partha Pratim Talukdar
- [← previous Felipe Sánchez-Martínez](https://md.mova.elamur.ai/free/en/docs/papers/authors/felipe-sanchez-martinez/)
- [next → Filip Ginter](https://md.mova.elamur.ai/free/en/docs/papers/authors/filip-ginter/)
- [↑ back to Authors](https://md.mova.elamur.ai/free/en/docs/papers/authors/)