@inproceedings{nederhof-2021-calculating,
    title = "Calculating the optimal step of arc-eager parsing for non-projective trees",
    author = "Nederhof, Mark-Jan",
    editor = "Merlo, Paola  and
      Tiedemann, Jorg  and
      Tsarfaty, Reut",
    booktitle = "Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume",
    month = apr,
    year = "2021",
    address = "Online",
    publisher = "Association for Computational Linguistics",
    url = "https://preview.aclanthology.org/add-emnlp-2024-awards/2021.eacl-main.193/",
    doi = "10.18653/v1/2021.eacl-main.193",
    pages = "2273--2283",
    abstract = "It is shown that the optimal next step of an arc-eager parser relative to a non-projective dependency structure can be calculated in cubic time, solving an open problem in parsing theory. Applications are in training of parsers by means of a {\textquoteleft}dynamic oracle'."
}