Universal Dependencies to Logical Form with Negation Scope

Federico Fancellu; Siva Reddy; Adam Lopez; Bonnie Webber

Universal Dependencies to Logical Form with Negation Scope

Federico Fancellu, Siva Reddy, Adam Lopez, Bonnie Webber

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Proceedings of the Workshop Computational Semantics Beyond Events and Roles
Place of Publication	Valencia, Spain
Publisher	Association for Computational Linguistics
Pages	22-32
Number of pages	11
Publication status	Published - 1 Apr 2017
Event	Computational Semantics Beyond Events and Roles 2017 - Valencia, Spain Duration: 4 Apr 2017 → 4 Apr 2017 http://www.cse.unt.edu/sembear2017/callforpapers.html

Conference

Conference	Computational Semantics Beyond Events and Roles 2017
Abbreviated title	SemBEaR 2017
Country/Territory	Spain
City	Valencia
Period	4/04/17 → 4/04/17
Internet address	http://www.cse.unt.edu/sembear2017/callforpapers.html

Access to Document

W17-1804Final published version, 186 KBLicence: Creative Commons: Attribution (CC-BY)

http://www.aclweb.org/anthology/W17-1804Licence: Creative Commons: Attribution (CC-BY)

Cite this

@inproceedings{73b47594be004446ad730dd8796c3e2a,

title = "Universal Dependencies to Logical Form with Negation Scope",

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.",

author = "Federico Fancellu and Siva Reddy and Adam Lopez and Bonnie Webber",

year = "2017",

month = apr,

day = "1",

language = "English",

pages = "22--32",

booktitle = "Proceedings of the Workshop Computational Semantics Beyond Events and Roles",

publisher = "Association for Computational Linguistics",

note = "Computational Semantics Beyond Events and Roles 2017, SemBEaR 2017 ; Conference date: 04-04-2017 Through 04-04-2017",

url = "http://www.cse.unt.edu/sembear2017/callforpapers.html",

}

Fancellu, F, Reddy, S, Lopez, A & Webber, B 2017, Universal Dependencies to Logical Form with Negation Scope. in Proceedings of the Workshop Computational Semantics Beyond Events and Roles. Association for Computational Linguistics, Valencia, Spain, pp. 22-32, Computational Semantics Beyond Events and Roles 2017, Valencia, Spain, 4/04/17. <http://www.aclweb.org/anthology/W17-1804>

TY - GEN

T1 - Universal Dependencies to Logical Form with Negation Scope

AU - Fancellu, Federico

AU - Reddy, Siva

AU - Lopez, Adam

AU - Webber, Bonnie

PY - 2017/4/1

Y1 - 2017/4/1

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 22

EP - 32

BT - Proceedings of the Workshop Computational Semantics Beyond Events and Roles

PB - Association for Computational Linguistics

CY - Valencia, Spain

T2 - Computational Semantics Beyond Events and Roles 2017

Y2 - 4 April 2017 through 4 April 2017

ER -

Universal Dependencies to Logical Form with Negation Scope

Abstract

Conference

Access to Document

Fingerprint

Cite this