Pith. Sign in

RECORD

Universal Dependencies to Logical Forms with Negation Scope

PaperPDF from arXiv

data files

Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Federico Fancellu, Siva Reddy, Adam Lopez, Bonnie Webber

Computation and Language · Submitted 10 Feb 2017

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim 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.

how it is stated · asserted 0.52 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID1702.03305 (version 1)
Pith IDA7PF6ZSW, Pith's permanent record of this paper and its review
CitationAdam Lopez, Bonnie Webber, Federico Fancellu, Siva Reddy. "Universal Dependencies to Logical Forms with Negation Scope." arXiv:1702.03305 (2017). https://pith.science/paper/A7PF6ZSW
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,251 input tokens.

What the abstract itself states, as probabilities: claims first 0.07 · states limitation 0.62 · human participants 0.03 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.11 · mentions code or data availability 0.04.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

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$\lnot$ 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.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 Many language technology applications would benefit from the ability to represent negation and its scope on top of widely-used linguistic resources. background 0.97 0.05 0.04 hedged possibility 0.70
s1 In this paper, we investigate the possibility of obtaining a first-order logic representation with negation scope marked using Universal Dependencies. contribution 1.00 0.64 0.06 hedged possibility 0.92
s2 To do so, we enhance UDepLambda, a framework that converts dependency graphs to logical forms. method 0.83 0.90 0.04 asserted 0.99
s3 The resulting UDepLambda$\lnot$ 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. method 0.48 0.85 0.40 asserted 1.00
s4 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. result 0.93 0.94 0.56 asserted 0.52

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from simulation or computation 0.52.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original 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$\lnot$ 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.

Human review

How Pith checks papers → · Full audit of this paper →

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.