[Mova](https://md.mova.elamur.ai/free/en/) · [this page in HTML](https://mova.elamur.ai/free/en/docs/papers/eacl-2021-aralikatte-ellipsis-resolution-as-question-answering/) [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/) / [English](https://md.mova.elamur.ai/free/en/docs/papers/en/) / Ellipsis Resolution as Question Answering: An Evaluation # Ellipsis Resolution as Question Answering: An Evaluation **Authors:** Rahul Aralikatte, [Matthew Lamm](https://md.mova.elamur.ai/free/en/docs/papers/authors/matthew-lamm/), [Daniel Hardt](https://md.mova.elamur.ai/free/en/docs/papers/authors/daniel-hardt/) and [Anders Søgaard](https://md.mova.elamur.ai/free/en/docs/papers/authors/anders-sogaard/) · **Year:** 2021 · **Venue:** Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume (EACL 2021) **Link:** [aclanthology.org/2021.eacl-main.68](https://aclanthology.org/2021.eacl-main.68/) · **Licence:** [CC BY 4.0](https://creativecommons.org/licenses/by/4.0/) [**13** citations](https://openalex.org/works?filter=cites:W3122578363) openalex · 2026-10-18[**8** citations in our library](https://md.mova.elamur.ai/free/en/docs/papers/cited-by/eacl-2021-aralikatte-ellipsis-resolution-as-question-answering/) of the 140673 papers whose bibliographies we read[Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume](https://aclanthology.org/volumes/2021.eacl-main/)[licence](https://creativecommons.org/licenses/by/4.0/) - [Publisher's page](https://aclanthology.org/2021.eacl-main.68/) - [PDF](https://aclanthology.org/2021.eacl-main.68.pdf) - [DOI 10.18653/v1/2021.eacl-main.68](https://doi.org/10.18653/v1/2021.eacl-main.68) - [OpenAlex](https://openalex.org/W3122578363) **Authors (4)** 1. [Rahul Aralikatte](https://openalex.org/A5107879471) [Semantic Scholar](https://www.semanticscholar.org/author/19509693) · h 11 · 631 citations · 52 works 2. [Matthew Lamm](https://openalex.org/A5005471354) [Semantic Scholar](https://www.semanticscholar.org/author/48024953) · h 13 · 2613 citations · 25 works 3. [Daniel Hardt](https://openalex.org/A5054824570) [ORCID](https://orcid.org/0000-0001-6041-1475) · [Semantic Scholar](https://www.semanticscholar.org/author/144610213) · h 19 · 1785 citations · 101 works 4. [Anders Søgaard](https://openalex.org/A5018138946) [ORCID](https://orcid.org/0000-0001-5250-4276) · [Semantic Scholar](https://www.semanticscholar.org/author/1700187) · h 43 · 8552 citations · 440 works Citations and author metrics from openalex (2026-10-18); authors with the same name are not always told apart. ## What it is about The paper treats ellipsis resolution as a reading-comprehension problem. The elided clause becomes a question, and the antecedent becomes the answer span in the preceding text. The authors train BERT-based models on sluice ellipsis and VP ellipsis, first alone and then jointly with question-answering and coreference data. For sluice ellipsis, the F1 rises from 70.00 to 86.01. For VP ellipsis it rises from 72.89 to 78.66. Joint training with coreference data adds up to 2.9 points for VP ellipsis. Combining the two ellipsis datasets gives about one point to each. The reported results average three runs with different random seeds. ## Ideas - I1. `en/src/ctx.rs`: for each ellipsis site, build the question as a string from the wh-remnant and the auxiliary, then accept a candidate antecedent only if its tree answers that question (same head, compatible clause type). This is a deterministic check of the paper's idea, with no neural model at test time. Measure on a test set whose licence allows it. - I2. Offline silver data: a large model may label ellipsis sites in batches, offline, for an `annot` gold check. It may not answer at test time. Check a sample of 100 labels by hand before they are used. - I3. Split the report by ellipsis type, sluice and VP, as the paper does, in every ellipsis report, so that a gain on one type cannot hide a loss on the other. ## For Mova The code is `en/src/ctx.rs`, `prag` and `annot`. The chapter is [29. Ellipsis, word order and information structure](https://md.mova.elamur.ai/free/en/docs/languages/en/29-ellipsis-word-order-information-structure/). The paper's models are neural, so only the question form and the check are a Mova analogue, not a port. Measure first: the question-based check against the current candidate choice, on a test set we may use. Topics: [Coreference resolution](https://md.mova.elamur.ai/free/en/docs/papers/topics/coreference-resolution/) ## Cite The paper itself, not this card. BibTeX from the library's record of the work. [DOI 10.18653/v1/2021.eacl-main.68](https://doi.org/10.18653/v1/2021.eacl-main.68) ``` @inproceedings{aralikatte2021ellipsis, title = {{Ellipsis Resolution as Question Answering: An Evaluation}}, author = {Aralikatte, Rahul and Lamm, Matthew and Hardt, Daniel and Søgaard, Anders}, booktitle = {Proceedings of the 16th Conference of the European Chapter of the Association for Computational Linguistics: Main Volume}, year = {2021}, doi = {10.18653/v1/2021.eacl-main.68}, url = {https://doi.org/10.18653/v1/2021.eacl-main.68} } ``` - [← previous English Machine Reading Comprehension Datasets: A Survey](https://md.mova.elamur.ai/free/en/docs/papers/dzendzik-2021-english-machine-reading-comprehension-datasets/) - [next → A Freely Available Syntactic Lexicon for English](https://md.mova.elamur.ai/free/en/docs/papers/egedi-1994-freely-available-syntactic-lexicon-english/) - [↑ back to English](https://md.mova.elamur.ai/free/en/docs/papers/en/) ## References 1 references, 0 of them with a card of ours. ↗ leads to the work, «find» searches for one we have no id for yet. 1. ## Related Work Mostafa Abdou, Cezar Sas, Rahul Aralikatte, Isabelle Augenstein, and Anders Søgaard. 2019. X-WikiRE: A large, multilingual resource for relation extraction as machine comprehension. In Proceedings of the 2nd Workshop on Deep Learning Approaches for Low-Resource NLP (DeepLo 2019), pages 265–274, Hong Kong, China. Association for Computational Linguistics. [find](https://scholar.google.com/scholar?q=%23%23+Related+Work+Mostafa+Abdou%2C+Cezar+Sas%2C+Rahul+Aralikatte%2C+Isabelle+Augenstein%2C+and+Anders+S%C3%B8gaard%2E+2019%2E+X%2DWikiRE%3A+A+large%2C+multilingual+resource+for+relation+extraction+as+machine+comprehension%2E+In)