PP-2007-37: A Strong Meaning Hypothesis from a Computational Perspective

PP-2007-37: Szymanik, Jakub (2007) A Strong Meaning Hypothesis from a Computational Perspective. [Report]

[img]
Preview
Text (Full Text)
PP-2007-37.text.pdf

Download (123kB) | Preview
[img] Text (Abstract)
PP-2007-37.abstract.txt

Download (418B)

Abstract

In this paper we study the computational complexity of reciprocal sentences with quantified antecedents. We observe a computational dichotomy between different interpretations of reciprocity and its connection with Strong Meaning Hypothesis.

Item Type: Report
Report Nr: PP-2007-37
Series Name: Prepublication (PP) Series
Year: 2007
Uncontrolled Keywords: reciprocal expressions; computational complexity; Strong Meaning Hypothesis
Subjects: Computation
Date Deposited: 12 Oct 2016 14:36
Last Modified: 12 Oct 2016 14:36
URI: https://eprints.illc.uva.nl/id/eprint/271

Actions (login required)

View Item View Item