Abstract
Many language technology applications would benefit from the ability to represent negation and its scope on top of widely-used linguistic resources. In this paper, we investigate the possibility of obtaining a first-order logic representation with negation scope marked using Universal Dependencies. To do so, we enhance UDepLambda, a framework that converts dependency graphs to logical forms. The resulting UDepLambda¬ is able to handle phenomena related to scope by means of an higher-order type theory, relevant not only to negation but also to universal quantification and other complex semantic phenomena. The initial conversion we did for English is promising, in that one can represent the scope of negation also in the presence of more complex phenomena such as universal quantifiers.- Anthology ID:
- W17-1804
- Volume:
- Proceedings of the Workshop Computational Semantics Beyond Events and Roles
- Month:
- April
- Year:
- 2017
- Address:
- Valencia, Spain
- Editors:
- Eduardo Blanco, Roser Morante, Roser Saurí
- Venue:
- SemBEaR
- SIG:
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 22–32
- Language:
- URL:
- https://aclanthology.org/W17-1804
- DOI:
- 10.18653/v1/W17-1804
- Cite (ACL):
- Federico Fancellu, Siva Reddy, Adam Lopez, and Bonnie Webber. 2017. Universal Dependencies to Logical Form with Negation Scope. In Proceedings of the Workshop Computational Semantics Beyond Events and Roles, pages 22–32, Valencia, Spain. Association for Computational Linguistics.
- Cite (Informal):
- Universal Dependencies to Logical Form with Negation Scope (Fancellu et al., SemBEaR 2017)
- PDF:
- https://preview.aclanthology.org/dois-2013-emnlp/W17-1804.pdf