Polynomial Event Semantics: A variable-free event semantics

 
Polynomial event semantics is a variable-free dialect of Neo-Davidsonian event semantics originally developed as a new approach to (quantifier) scope. It is later extended to negation, negative quantification, copular clauses, (quantified) relative clauses, and anaphora.

 

Non-Montagovian Proper Treatment of Quantifiers

We propose a simple extension of event semantics that naturally supports the compositional treatment of quantification. Our analyses require neither quantifier raising or other syntactic movements, nor type-lifting. Denotations are computed strictly compositionally, from lexical entries up, and quantifiers are analyzed in situ. We account for the universal, existential and counting quantification and the related distributive coordination, with the attendant quantifier ambiguity phenomena. The underlying machinery is not of lambda-calculus but of much simpler relational algebra, with the straightforward set-theoretic interpretation.

The source of quantifier ambiguity in our approach lies in two possible analyses for the existential and counting quantification. Their inherent ambiguity however becomes apparent only in the presence of another, non-existential quantification.

Version
The current version is March 2019
References
PolyEvent.pdf [289K]
The paper published in New Frontiers in Artificial Intelligence. JSAI-isAI 2018. Lecture Notes in Computer Science, 2019, vol 11717, pp 313-324. Springer.
doi:10.1007/978-3-030-31605-1_23

PolyEvent-talk.pdf [208K]
Talk at LENLS 2018, Kanagawa, Japan, November 13, 2018

poly.ml [18K]
The OCaml implementation of the model construction, to run all examples in the talk/paper

 

Negation

Polynomial event semantics is an interpretation of Neo-Davidsonian semantics in which the thorny event quantification problem does not even arise. Denotations are constructed strictly compositionally, from lexical entries up, and quantifiers are analyzed in situ. All advantages of event semantics, in particular, regarding entailment, are preserved. The previous work has dealt only with positive polarity phrases involving universal, existential and counting quantification.

We now extend the polynomial event semantics to sentences with negation and negative quantification, including adverbial quantification, with attendant ambiguities. The analysis remains compositional, and does not require positing of non-existing entities or events.

Version
The current version is March 2021
References
PolyNeg.pdf [259K]
The paper published in JSAI-isAI 2020: New Frontiers in Artificial Intelligence. Lecture Notes in Computer Science, vol 12758, 2021, pp 82-95. Springer.
doi:10.1007/978-3-030-79942-7_6

PolyNeg-talk.pdf [178K]
Talk at LENLS 2020, online, November 16, 2020

poly.ml [18K]
The OCaml implementation of the model construction, to run all examples in the talk/paper

 

QNP Textual Entailment with Polynomial Event Semantics

FraCaS textual entailment corpus has become the standard benchmark for semantics theories, in particular, theories of quantification (Sec. 1 of FraCaS). Here we apply it to polynomial event semantics: the latest approach to combining quantification and Neo-Davidsonian event semantics, maintaining compositionality and the in situ analysis of quantifiers. Although several FraCaS problems look custom-made for the polynomial events semantics, there are challenges: the variety of generalized quantifiers (including `many', `most' and `few'); copula, existence, and relative clauses. We address them in this paper.

Joint work with Haruki Watanabe.

Version
The current version is April 2022
References
PolyFra.pdf [269K]
The paper published in JSAI-isAI 2021: New Frontiers in Artificial Intelligence. Lecture Notes in Computer Science, vol 13856, 2023, pp 198-211. Springer.
doi:10.1007/978-3-031-36190-6_14

PolyFra-talk.pdf [205K]
The online talk at LENLS18, November 13, 2021.

 

Events and Relative Clauses

This work is the continuation of the development of polynomial event semantics (a dialect of Neo-Davidsonian event semantics), using the FraCaS textual entailment corpus as a whetstone. This time we grapple with various, often complicated, relative clauses.

Relative clauses have hardly been analyzed before in event semantics. Although simple cases are straightforward, challenges arise when a clause contains quantification, coordination or negation. We deal with such complications in the present paper, focusing on entailments.

Joint work with Haruki Watanabe.

Version
The current version is July 2023
References
PolyRel.pdf [238K]
LENLS 2022: Logic and Engineering of Natural Language Semantics. Lecture Notes in Computer Science, vol 14213, 2023, pp 18–30. Springer
doi:10.1007/978-3-031-43977-3_2

PolyRel-talk.pdf [197K]
The talk at LENLS19, November 21, 2022. University of Tokyo.