An official website of the United States government
Abstract We describe and analyze the semantics of rationale and precautioning clauses (i.e. in order to- and lest-clauses) through a detailed case study of two operators in A’ingae (or Cofán, iso 639-3: con, an Amazonian isolate): the infinitive -ye ‘inf’ and the apprehensional -sa’ne ‘appr.’ We provide a new account of rationale semantics and the first formal account of precautioning semantics. We propose that in structures such as [$$p$$ [(in order) to$$q$$]] or [$$p$$ [$$q$$-ye]], the rationale operator (underlined) encodes modal semantics where the goal worlds of the actor responsible for $$p$$ achieve $$q$$. In structures such as [$$p$$ [lest$$q$$]] or [$$p$$ [$$q$$-sa’ne]], the precautioning operator encodes modal semantics where the actor’s goal worlds avoid a recoverable situation $$r$$ which entails $$q$$ ($$r\Rightarrow q$$). We observe and account for three apparent asymmetries within the domain of rationale and precautioning semantics, which we dub precautioning semantics asymmetry, rationale polarity asymmetry, and precautioning encoding asymmetry. We thus elucidate the relation between rationale and precautioning clauses and make substantial predictions with respect to the cross-linguistic inventories of rationale and precautioning operators.
more »
« less
This content will become publicly available on May 14, 2026
A Q-Theoretic solution to A'ingae postlabial rounding
I describe and analyze a process of postlabial rounding in A’ingae (isolate, ISO 639-3: con): after labial consonants, the diphthong /ae/ may surface as [oe]. However, a postlabial monophthongal /a/ always surfaces faithfully as [a]. To capture these facts, I propose an analysis couched in Q-Theory, where one vocalic target of a diphthong corresponds to fewer subsegments than a monophthong. This predicts that diphthongs might show an emergence-of-the-unmarked (TETU) effect, while monophthongs surface faithfully. The prediction is borne out by A’ingae postlabial rounding, contributing a novel argument for the Q-Theoretic representations. Finally, I show that similar asymmetries between diphthongs and monophthongs have recurred throughout the language’s history, further strengthening the proposal.
more »
« less
- Award ID(s):
- 2314344
- PAR ID:
- 10612067
- Publisher / Repository:
- Massachusetts Institute of Technology
- Date Published:
- Journal Name:
- Linguistic Inquiry
- ISSN:
- 0024-3892
- Page Range / eLocation ID:
- 1–14
- Subject(s) / Keyword(s):
- diphthong labialization TETU Cofán assimilation subsegment
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Algorithms operating on real numbers are implemented as floating-point computations in practice, but floatingpoint operations introduceroundoff errorsthat can degrade the accuracy of the result. We propose , a functional programming language with a type system that can express quantitative bounds on roundoff error. Our type system combines a sensitivity analysis, enforced through a linear typing discipline, with a novel graded monad to track the accumulation of roundoff errors. We prove that our type system is sound by relating the denotational semantics of our language to the exact and floating-point operational semantics. To demonstrate our system, we instantiate with error metrics proposed in the numerical analysis literature and we show how to incorporate rounding operations that faithfully model aspects of the IEEE 754 floating-point standard. To show that can be a useful tool for automated error analysis, we develop a prototype implementation for that infers error bounds that are competitive with existing tools, while often running significantly faster. Finally, we consider semantic extensions of our graded monad to bound error under more complex rounding behaviors, such as non-deterministic and randomized rounding.more » « less
-
null (Ed.)We consider the problem of makespan minimization on unrelated machines when job sizes are stochastic. The goal is to find a fixed assignment of jobs to machines, to minimize the expected value of the maximum load over all the machines. For the identical-machines special case when the size of a job is the same across all machines, a constant-factor approximation algorithm has long been known. Our main result is the first constant-factor approximation algorithm for the general case of unrelated machines. This is achieved by (i) formulating a lower bound using an exponential-size linear program that is efficiently computable and (ii) rounding this linear program while satisfying only a specific subset of the constraints that still suffice to bound the expected makespan. We also consider two generalizations. The first is the budgeted makespan minimization problem, where the goal is to minimize the expected makespan subject to scheduling a target number (or reward) of jobs. We extend our main result to obtain a constant-factor approximation algorithm for this problem. The second problem involves q-norm objectives, where we want to minimize the expected q-norm of the machine loads. Here we give an [Formula: see text]-approximation algorithm, which is a constant-factor approximation for any fixed q.more » « less
-
This paper examines switch reference (SR) in A’ingae, an understudied isolate language from Amazonian Ecuador. We present a theoretically informed survey of SR, identifying three distinct uses of switch reference: in clause chaining, adverbial clauses, and so-called ‘bridging’ clause linkage. We describe the syntactic and semantic properties of each use in detail, the first such description for A’ingae, showing that the three constructions differ in important ways. While leaving a full syntactic analysis to future work, we argue that these disparate properties preclude a syntactic account that unifies these three constructions to the exclusion of other environments without SR. Conversely, while a full semantic account is also left to future work, we suggest that a unified semantic account in terms of discourse coherence principles appears more promising. In particular, we propose that switch reference in A’ingae occurs in all and only the constructions that are semantically restricted to non-structuring coordinating coherence relations in the sense of Segmented Discourse Representation Theory.more » « less
-
null (Ed.)Abstract We show that every finite group of order divisible by 2 or q , where q is a prime number, admits a $$\{2, q\}'$$ { 2 , q } ′ -degree nontrivial irreducible character with values in $${\mathbb{Q}}(e^{2 \pi i /q})$$ Q ( e 2 π i / q ) . We further characterize when such character can be chosen with only rational values in solvable groups. These results follow from more general considerations on groups admitting a $$\{p, q\}'$$ { p , q } ′ -degree nontrivial irreducible character with values in $${\mathbb{Q}}(e^{2 \pi i /p})$$ Q ( e 2 π i / p ) or $${\mathbb{Q}}(e^{ 2 \pi i/q})$$ Q ( e 2 π i / q ) , for any pair of primes p and q . Along the way, we completely describe simple alternating groups admitting a $$\{p, q\}'$$ { p , q } ′ -degree nontrivial irreducible character with rational values.more » « less
