SOTAVerified

Monotonicity Marking from Universal Dependency Trees

2021-04-17IWCS (ACL) 2021Code Available0· sign in to hype

Zeming Chen, Qiyue Gao

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

Dependency parsing is a tool widely used in the field of Natural language processing and computational linguistics. However, there is hardly any work that connects dependency parsing to monotonicity, which is an essential part of logic and linguistic semantics. In this paper, we present a system that automatically annotates monotonicity information based on Universal Dependency parse trees. Our system utilizes surface-level monotonicity facts about quantifiers, lexical items, and token-level polarity information. We compared our system's performance with existing systems in the literature, including NatLog and ccg2mono, on a small evaluation dataset. Results show that our system outperforms NatLog and ccg2mono.

Tasks

Reproductions