Verb Phrase Ellipsis Resolution Using Discriminative and Margin-Infused Algorithms

What it is about

The paper resolves VP ellipsis (VPE) in two steps. The first step decides whether a word triggers VPE. The second picks the antecedent clause and its exact boundaries. Both steps are supervised machine learning over features from an automatically parsed corpus, the Bos and Spenader VPE data on the Wall Street Journal. Trigger detection uses a logistic regression classifier with separate handling of six trigger forms, including modals, the verbs be, do and have, and to-VPE. Detection accuracy rises from 69.52% to 80.78%, an improvement of over 11%. For antecedent identification, a margin-infused (MIRA) ranker beats a simple baseline. The chosen strategy gets 92% of gold antecedents right on the validation set by head match.

Ideas

• I1. en/src/expert.rs: write one deterministic rule per trigger form (modal, be, do, have, to) and report its accuracy next to the logistic model. If the rules match the model on a test set we may use, the model is not needed for detection.
• I2. c-command check: keep only antecedent heads that c-command the trigger in the UD tree, approximated by the path from the head to the trigger. Measure head accuracy on the test set with and without the check. The paper finds c-command important for both steps.
• I3. Stage-separated report: report detection accuracy, antecedent accuracy and end-to-end resolution in separate lines, and the ceiling from gold triggers, as the paper does. This shows which step limits the system before any tuning.

For Mova

The code is en/src/expert.rs and en/src/ctx.rs. The chapter is 29. Ellipsis, word order and information structure. The Wall Street Journal data is Penn Treebank data, which is licensed, so the paper's numbers are not Mova numbers and the data is not built in. Measure first on a VPE test set whose licence allows testing, with the rule and model comparison.

Topics: Coreference resolution

Cite

The paper itself, not this card. BibTeX from the library's record of the work. DOI 10.18653/v1/d16-1179

@inproceedings{kenyondean2016verb,
  title = {{Verb Phrase Ellipsis Resolution Using Discriminative and Margin-Infused Algorithms}},
  author = {Kenyon-Dean, Kian and Cheung, Jackie Chi Kit and Precup, Doina},
  booktitle = {Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing},
  year = {2016},
  doi = {10.18653/v1/d16-1179},
  url = {https://doi.org/10.18653/v1/d16-1179}
}

References

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

1. David Ahn. 2006. The stages of event extraction. In Proceedings of the Workshop on Annotating and Reasoning about Time and Events, pages 1–8. Association for Computational Linguistics. find
2. Cosmin Adrian Bejan and Sanda Harabagiu. 2010. Unsupervised event coreference resolution with rich linguistic features. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, pages 1412–1422. Association for Computational Linguistics. find
3. Johan Bos and Jennifer Spenader. 2011. An annotated corpus for the analysis of VP ellipsis. Language Resources and Evaluation, 45(4):463–494. find
4. Johan Bos. 2012. Robust VP ellipsis resolution in DR theory. In Staffan Larsson and Lars Borin, editors, From Quantification to Conversation, volume 19 of Tributes, pages 145–159. College Publications. find
5. Andrew Carnie. 2013. Syntax: A generative introduction. John Wiley & Sons. find
6. Koby Crammer, Ofer Dekel, Joseph Keshet, Shai Shalev-Shwartz, and Yoram Singer. 2006. Online passive-aggressive algorithms. The Journal of Machine Learning Research, 7:551–585. find
7. Mary Dalrymple, Stuart M Shieber, and Fernando CN Pereira. 1991. Ellipsis and higher-order unification. Linguistics and Philosophy, 14(4):399–452. find
8. Gurobi Optimization Inc. 2015. Gurobi optimizer reference manual. find
9. Daniel Hardt. 1992. An algorithm for VP ellipsis. In Proceedings of the 30th Annual Meeting on Association for Computational Linguistics, pages 9–14. Association for Computational Linguistics. find
10. Daniel Hardt. 1997. An empirical approach to VP ellipsis. Computational Linguistics, 23(4):525–541. find our card
11. Jin-Dong Kim, Tomoko Ohta, Sampo Pyysalo, Yoshinobu Kano, and Jun’ichi Tsujii. 2009. Overview of BioNLP ’09 shared task on event extraction. In Proceedings of the Workshop on Current Trends in Biomedical Natural Language Processing: Shared Task, pages 1–9. Association for Computational Linguistics. find
12. Heeyoung Lee, Marta Recasens, Angel Chang, Mihai Surdeanu, and Dan Jurafsky. 2012. Joint entity and event coreference resolution across documents. In Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning, pages 489–500. Association for Computational Linguistics. find
13. Zhengzhong Liu, Jun Araki, Eduard H Hovy, and Teruko Mitamura. 2014. Supervised within-document event coreference using information propagation. In LREC, pages 4539–4544. find
14. Zhengzhong Liu, Edgar Gonzalez, and Dan Gillick. 2016. Exploring the steps of verb phrase ellipsis. In Proceedings of the Workshop on Coreference Resolution Beyond OntoNotes (CORBON 2016), co-located with NAACL 2016, pages 32–40. find our card
15. Christopher D. Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven J. Bethard, and David McClosky. 2014. The Stanford CoreNLP natural language processing toolkit. In Association for Computational Linguistics (ACL) System Demonstrations, pages 55–60. find
16. Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online large-margin training of dependency parsers. In Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics, pages 91–98. Association for Computational Linguistics. find our card
17. Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Corrado, and Jeff Dean. 2013. Distributed representations of words and phrases and their compositionality. In Advances in neural information processing systems, pages 3111–3119. find
18. Leif Arda Nielsen. 2005. A Corpus-Based Study of Verb Phrase Ellipsis Identification and Resolution. Ph.D. thesis, King’s College London. find
19. Alan Ritter, Oren Etzioni, Sam Clark, et al. 2012. Open domain event extraction from twitter. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1104– 1112. ACM. find
20. Ivan A Sag. 1976. Deletion and logical form. Ph.D. thesis, Massachusetts Institute of Technology. find
21. David Vadas and James Curran. 2007. Adding noun phrase structure to the penn treebank. In Annual Meeting - Association for Computational Linguistics, volume 45, page 240. find our card
22. Taro Watanabe, Jun Suzuki, Hajime Tsukada, and Hideki Isozaki. 2007. Online large-margin training for statistical machine translation. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), pages 764– 773. find

This page in Markdown → https://md.mova.elamur.ai/free/en/docs/papers/aclbulk-2016-dean-verb-phrase-ellipsis-resolution-discriminative/