---
title: "A non-projective greedy dependency parser with bidirectional"
description: "BIST-COVINGTON is a greedy parser that implements Covington's algorithm for unrestricted… 3 references, cited by 4 papers here."
authors: ["David Vilares", "Carlos Gómez-Rodríguez"]
year: 2017
venue: "Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies"
source: "https://aclanthology.org/K17-3016/"
doi: "10.18653/v1/k17-3016"
arxiv: "1707.03228"
licence: "CC BY 4.0 (ACL Anthology)"
licence_url: "https://creativecommons.org/licenses/by/4.0/"
summary_licence: "Elamur Cosmic License"
canonical: "https://research.elamur.ai/free/en/papers/vilares-2017-non-projective-greedy-dependency-parser/"
---
[Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/papers/vilares-2017-non-projective-greedy-dependency-parser/)

[home](https://md.research.elamur.ai/free/en/) / [papers](https://md.research.elamur.ai/free/en/papers/) / [2017](https://md.research.elamur.ai/free/en/papers/2017/page/4/) / A non-projective greedy dependency parser with bidirectional LSTMs

# A non-projective greedy dependency parser with bidirectional LSTMs

Paper · 2017 · David Vilares and Carlos Gómez-Rodríguez

**Authors:** [David Vilares](https://md.research.elamur.ai/free/en/authors/david-vilares/) and [Carlos Gómez-Rodríguez](https://md.research.elamur.ai/free/en/authors/carlos-gomez-rodriguez/) · **Year:** 2017 · **Venue:** Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies **Link:** [aclanthology.org/K17-3016](https://aclanthology.org/K17-3016/) · **Licence:** [CC BY 4.0](https://creativecommons.org/licenses/by/4.0/)

[**8** citations OpenAlex, 2026-10-14](https://openalex.org/works?filter=cites:W2734847366) · [Cited by **4** papers in our library of the 141,840 papers whose bibliographies we read](https://md.research.elamur.ai/free/en/papers/vilares-2017-non-projective-greedy-dependency-parser/cited-by/) · [Conference on Computational Natural Language Learning (CoNLL)](https://md.research.elamur.ai/free/en/venues/conll/) · [CoNLL 2017](https://md.research.elamur.ai/free/en/venues/conll/2017/) — Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies · published by [Association for Computational Linguistics](https://md.research.elamur.ai/free/en/publishers/association-for-computational-linguistics/) · [licence](https://creativecommons.org/licenses/by/4.0/)

- [Publisher's page](https://aclanthology.org/K17-3016/)
- [PDF](https://aclanthology.org/K17-3016.pdf)
- [DOI 10.18653/v1/k17-3016](https://doi.org/10.18653/v1/k17-3016)
- [arXiv 1707.03228](https://arxiv.org/abs/1707.03228)
- [OpenAlex](https://openalex.org/W2734847366)

**Authors (2)**

1. [David Vilares](https://openalex.org/A5039380414) [ORCID](https://orcid.org/0000-0002-1295-3840) · [Semantic Scholar](https://www.semanticscholar.org/author/3259155) · h 19 · 1,573 citations · 158 works
2. Carlos Gómez-Rodríguez

Citations and author metrics: OpenAlex, 2026-10-14; authors with the same name are not always told apart.

## What it is about

BIST-COVINGTON is a greedy parser that implements Covington's algorithm for unrestricted non-projective dependency parsing as a transition system, with O(n^2) complexity. The scorer is a bidirectional LSTM in the style of Kiperwasser and Goldberg, trained with a dynamic oracle to reduce error propagation. The submission used the official UDPipe 1.1 segmentation and tagging, no ensemble and no custom tokenization. It ranked 7th of 33 teams on the CoNLL 2017 big-treebank category (55 treebanks), and 16th and 12th in LAS and UAS over all treebanks. The authors trace their weaker "all" results to four parallel PUD treebanks, where suffixed treebank models transfer poorly.

## For Mova

- I1. en/src/parse.rs: add Covington's non-projective transition system as a second decoder over the same features; measure LAS and UAS on EWT test and on GUM test (test only), and the share of gold non-projective arcs that are recovered.
- I2. gparse/src/eisner.rs: measure how many gold EWT test arcs are non-projective and therefore cannot be produced by the Eisner decoder; this sets whether a non-projective decoder is worth the run in I1.
- I3. Runtime of the two decoders on EWT test per 1,000 sentences, to check the O(n^2) claim of the paper against the beam-8 arc-standard search in `en`.

Non-projective arcs are the displacement phenomenon of 29-ellipsis-word-order-information-structure and of extraposed clauses in 25-relative-clauses, and the general syntax is in 20-syntax-overview. The code touched is `en/src/parse.rs` and `gparse/src/eisner.rs`. Measure first: the non-projective share and the Eisner ceiling of idea I2, since they decide whether idea I1 is worth a run.

## Institutions

[🎓**Universidade da Coruña** A Coruña · Spain 10 works · 273 citations](https://md.research.elamur.ai/free/en/universities/universidade-da-coruna/)

## Fields, topics and concepts

📚 Shelves 4 The field of science this work belongs to (OpenAlex fields).[Computer Science · 9,085 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 8,888 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Arts and Humanities · 9,296 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Language and Linguistics · 9,206 works](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/)

🧭 Topics 2 Research subjects and languages the work is about.[English · 1,373 works](https://md.research.elamur.ai/free/en/topics/english/) · [Dependency parsing · 120 works](https://md.research.elamur.ai/free/en/topics/dependency-parsing/)

## Cite

Cite as David Vilares and Carlos Gómez-Rodríguez. 2017. A non-projective greedy dependency parser with bidirectional LSTMs. Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies.

The paper itself, not this card. BibTeX from the library's record of the work. [DOI 10.18653/v1/k17-3016](https://doi.org/10.18653/v1/k17-3016) · [arXiv 1707.03228](https://arxiv.org/abs/1707.03228)

```bibtex
@inproceedings{vilares2017non,
  title = {{A non-projective greedy dependency parser with bidirectional LSTMs}},
  author = {David Vilares and Carlos Gómez-Rodríguez},
  booktitle = {Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies},
  year = {2017},
  doi = {10.18653/v1/k17-3016},
  eprint = {1707.03228},
  archivePrefix = {arXiv},
  url = {https://doi.org/10.18653/v1/k17-3016}
}
```

- [← previous The lexical pragmatics of count-mass polysemy](https://md.research.elamur.ai/free/en/papers/falkum-2017-lexical-pragmatics-count-mass-polysemy/)
- [next → Analyzing the Impact of Spelling Errors on POS-Tagging and Chunking in Learner English](https://md.research.elamur.ai/free/en/papers/mizumoto-2017-analyzing-impact-spelling-errors-pos/)
- [↑ back to papers of 2017](https://md.research.elamur.ai/free/en/papers/2017/page/4/)

## References

3 references, 1 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet.

1. Željko Agić and Natalie Schluter. 2017. How (not) to train a dependency parser: The curious case of jackknifing part-of-speech taggers. In The 54th Annual Meeting of the Association for Computational Linguistics (ACL 2017). [find](https://scholar.google.com/scholar?q=Z%CC%8Celjko+Agic%CC%81+and+Natalie+Schluter%2E+2017%2E+How+%28not%29+to+train+a+dependency+parser%3A+The+curious+case+of+jackknifing+part%2Dof%2Dspeech+taggers%2E+In+The+54th+Annual+Meeting+of+the+Association+for+Computationa)
2. Giuseppe Attardi. 2006. Experiments with a mul-tilanguage non-projective dependency parser. In Proceedings of the Tenth Conference on Computational Natural Language Learning. Association for Computational Linguistics, pages 166–170. [http://dl.acm.org/citation.cfm?id=1596276.1596307](http://dl.acm.org/citation.cfm?id=1596276.1596307). [↗](http://dl.acm.org/citation.cfm?id=1596276.1596307)
3. Danqi Chen and Christopher Manning. 2014. [A fast and accurate dependency parser using neural networks](https://md.research.elamur.ai/free/en/papers/chen-2014-fast-accurate-dependency-parser-neural/). In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP). Doha, Qatar, pages 740–750. [http://www.aclweb.org/anthology/D14-1082](http://www.aclweb.org/anthology/D14-1082). \#\# Conclusion [↗](http://www.aclweb.org/anthology/D14-1082)

Updated 24 October 2026
