Universal Dependencies to Logical Forms with Negation Scope

by   Federico Fancellu, et al.

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.


page 1

page 2

page 3

page 4


Universal Semantic Parsing

Universal Dependencies (UD) offer a uniform cross-lingual syntactic repr...

On Reductions of Hintikka Sets for Higher-Order Logic

Steen's (2018) Hintikka set properties for Church's type theory based on...

The Grail theorem prover: Type theory for syntax and semantics

As the name suggests, type-logical grammars are a grammar formalism base...

All Roads Lead to UD: Converting Stanford and Penn Parses to English Universal Dependencies with Multilayer Annotations

We describe and evaluate different approaches to the conversion of gold ...

Lambda Dependency-Based Compositional Semantics

This short note presents a new formal language, lambda dependency-based ...

Pragmatic Side Effects

In the quest to give a formal compositional semantics to natural languag...

Intensionalizing Abstract Meaning Representations: Non-Veridicality and Scope

Abstract Meaning Representation (AMR) is a graphical meaning representat...

Code Repositories


A framework to convert Universal Dependencies to Logical Forms

view repo