An official website of the United States government
Abstract Theories of imperatives differ in how they aim to derive the distributional and functional properties of this clause type. One point of divergence is how to capture the fact that imperative utterances convey the speaker’s endorsement for the course of events described. Condoravdi & Lauer (2017) observe that conditionals with imperative consequents (conditionalized imperatives, CIs) are infelicitous as motivations of advice against doing something and take this as evidence for an analysis of imperatives as encoding speaker endorsement. We investigate CIs in further contexts and argue that their account in terms of preferential conflicts fails to capture the more general infelicity of CIs as motivations for or against doing something. We develop an alternative in which imperatives do not directly encode speaker preferences, but express modalized propositions and impose restrictions on the discourse structure (along the lines of Kaufmann, 2012). We show how this carries over to conditionalized imperatives to derive the behavior of CIs, and conclude with a discussion of more general problems regarding an implementation of conditional preferential commitments, an issue that can be avoided on our account of imperatives.
more »
« less
Endorsement of inconsistent imperatives
There is an ongoing debate regarding how imperatives convey speaker endorsement. One line of approach builds it into the imperative meaning. Another posits weaker meanings. Indifference uses, like 'Go right! Go left! I don't care!', pose a challenge to the endorsement account. We reconcile the endorsement approach with such uses and argue that they can reduce to the speaker endorsing disjunctive prejacents, which results from one imperative operator taking a list of prejacents under its scope. This analysis predicts that intonational patterns that signal lists will facilitate disjunctive interpretations. We test and confirm this prediction in an experimental study.
more »
« less
- Award ID(s):
- 1659585
- PAR ID:
- 10095417
- Date Published:
- Journal Name:
- Proceedings of the Linguistic Society of America
- Volume:
- 4
- Issue:
- 1
- ISSN:
- 2473-8689
- Page Range / eLocation ID:
- 58; 1-12
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Current deep learning based multi-channel speaker sepa- ration methods produce a monaural estimate of speaker sig- nals captured by a reference microphone. This work presents a new multi-channel complex spectral mapping approach that simultaneously estimates the real and imaginary spectrograms of all speakers at all microphones. The proposed multi-input multi-output (MIMO) separation model uses a location-based training (LBT) criterion to resolve the permutation ambiguity in talker-independent speaker separation across microphones. Experimental results show that the proposed MIMO separation model outperforms a multi-input single-output (MISO) speaker separation model with monaural estimates. We also combine the MIMO separation model with a beamformer and a MISO speech enhancement model to further improve separation performance. The proposed approach achieves the state-of-the-art speaker separation on the open LibriCSS dataset.more » « less
-
Barner, David; Bramley, Neil; Ruggeri, Azzurra; Walker, Caren (Ed.)Generalizations are powerful tools to convey information agents need to predict and control their environments. However, some generalizations are restricted to “sociocultural bubbles”. How are such patterns communicated? We report one interdisciplinary study — bridging philosophy, linguistics, and cognitive developmental psychology — which examined the developing capacity for contextual restriction of generics in 4- 7-year-olds (N=137) and adults (N=63). We provided context cues signaling that the speaker used a generic generalization to convey a broad vs. contextually-restricted regularity, and measured endorsement of generics attributing properties prevalent globally vs. within “bubbles”. Adults endorsed generics flexibly, tracking context cues, but younger children struggled, over-attributing socially contingent properties to the group beyond the “bubble”, on par with context-general regularities. This reveals a troubling discrepancy between children and adults’ interpretations of generics, opening the door for cross-generational miscommunication. We discuss strategies to mitigate this in educational and family communication settings.more » « less
-
In the Zero-Knowledge Proof (ZKP) of a disjunctive statement, P and V agree on B fan-in 2 circuits C0, . . . , CB−1 over a field F; each circuit has n_in inputs, n_× multiplications, and one output. P’s goal is to demonstrate the knowledge of a witness (id ∈ [B], w ∈ F^n_in ), s.t. Cid (w) = 0 where neither w nor id is revealed. Disjunctive statements are effective, for example, in implementing ZKP based on sequential execution of CPU steps. This paper studies ZKP (of knowledge) protocols over disjunctive statements based on Vector OLE. Denoting by λ the statistical security parameter and let ρ \in^\Delta max{log |F|, λ}, the previous state-of-the-art protocol Robin (Yang et al. CCS’23) required (n_in +3n_×) log |F|+O(ρB) bits of communication with O(1) rounds, and Mac'n'Cheese (Baum et al. CRYPTO’21) required (n_in +n_×) log |F|+2n×ρ+O(ρ logB) bits of communication with O(logB) rounds, both in the VOLE-hybrid model. Our novel protocol LogRobin++ achieves the same functionality at the cost of (n_in+n_×) log |F|+O(ρ logB) bits of communication with O(1) rounds in the VOLE-hybrid model. Crucially, LogRobin++ takes advantage of two new techniques – (1) an O(logB)-overhead approach to prove in ZK that an IT-MAC commitment vector contains a zero; and (2) the realization of VOLE-based ZK over a disjunctive statement, where P commits only to w and multiplication outputs of Cid (w) (as opposed to prior work where P commits to w and all three wires that are associated with each multiplication gate). We implemented LogRobin++ over Boolean (i.e., F2) and arithmetic (i.e., F_2^61−1) fields. In our experiments, including the cost of generating VOLE correlations, LogRobin++ achieved up to 170× optimization over Robin in communication, resulting in up to 7× (resp. 3×) wall-clock time improvements in a WAN-like (resp. LAN-like) setting.more » « less
-
The Julia programming language supports multiple dispatch and provides a rich type annotation language to specify method applicability. When multiple methods are applicable for a given call, Julia relies on subtyping between method signatures to pick the correct method to invoke. Julia's subtyping algorithm is surprisingly complex, and determining whether it is correct remains an open question. In this paper, we focus on one piece of this problem: the interaction between union types and covariant tuples. Previous work normalized unions inside tuples to disjunctive normal form. However, this strategy has two drawbacks: complex type signatures induce space explosion, and interference between normalization and other features of Julia's type system. In this paper, we describe the algorithm that Julia uses to compute subtyping between tuples and unions - an algorithm that is immune to space explosion and plays well with other features of the language. We prove this algorithm correct and complete against a semantic-subtyping denotational model in Coq.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.3765/plsa.v4i1.4562
