Universal Dependencies to Logical Form with Negation Scope

Federico Fancellu, Siva Reddy, Adam Lopez, Bonnie Webber

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.
Original languageEnglish
Title of host publicationProceedings of the Workshop Computational Semantics Beyond Events and Roles
Place of PublicationValencia, Spain
PublisherAssociation for Computational Linguistics
Number of pages11
Publication statusPublished - 1 Apr 2017
EventComputational Semantics Beyond Events and Roles 2017 - Valencia, Spain
Duration: 4 Apr 20174 Apr 2017


ConferenceComputational Semantics Beyond Events and Roles 2017
Abbreviated titleSemBEaR 2017
Internet address


Dive into the research topics of 'Universal Dependencies to Logical Form with Negation Scope'. Together they form a unique fingerprint.

Cite this