Franke and Bergen (2020): Theory-Driven Statistical Modeling for Semantics and Pragmatics #
Franke and Bergen compare four rational speech act models, in the style of Frank and Goodman, of the
nested Aristotelians Q₁ of the aliens drank Q₂ of their water, with none, some and all in
each position. An alien's type is the vertex of the triangle of opposition its drinking falls on
(Aristotelian.Triangle), none of its water, some but not all, or all, a world state is the
nonempty set of types some alien realizes, and a parse is the set of sites, among the whole sentence
and the two quantifiers, at which an exhaustivity operator applies. The vanilla model has only the
literal parse; lexical uncertainty, after Bergen, Levy and Goodman and Potts et al., fixes a lexicon
per speaker; the local- and global-implicature speakers choose an utterance together with a
matrix-free or arbitrary parse, one softmax over pairs per world.
Main results #
table1_ssand its siblings: the readings of every utterance under every parse, the paper's Table 1.vanilla_ss_prefers_wNA,gi_ss_prefers_wNS: the global model corrects the interpretation of some of the aliens drank some of their water that the vanilla model gets wrong.ss_m_parse_pref,m_ss_singleton: its parse posterior peaks at the matrix-only parse, whose reading singles out the world with none- and some-drinkers only, the paper's explanation of the global model's win.perParse_ss_prefers_o: under the per-parse normalization the paper rejects, exhaustifying the outer quantifier beats exhaustifying the whole sentence at every rationality.
Implementation notes #
- One reading family,
ext, generates every model: the vanilla model is its literal member, the speakers of the pooled models choose among utterance–parse pairs and their listeners hear the utterance, and lexical uncertainty, like the rejected per-parse architecture, fixes the latent as an argument of the speaker. Sentential alternatives range over a fourth quantifier, not all, that is never uttered. This is the paper's distinction between grammatical and utterance alternatives, which its model comparison favors over the alternative set of Gotzner and Romoli. - Findings that hold at every rationality are closed by strict stochastic dominance of
informativity profiles (
Multiset.StrictDominates); the rationality-dependent ones are pinned at the paper's illustrative value of 5, where the comparisons clear to inequalities of naturals. - The paper's cost term for none-initial utterances and its fixed error rate are omitted, and the vanilla preference reverses at the fitted cost. The second-level layer of the lexical-uncertainty model, after Lassiter and Goodman, is omitted; the first-level listener formalized here keeps the preference the paper's second-level listener loses.
- The paper's matrix exhaustivity operator is not Fox's innocent exclusion
(
moi_ss_ne_innocent_exclusion). The distinct matrix reading of none of the aliens drank none of their water comes from the lexical alternative not all of none, after Levinson.
References #
The grammar of readings #
Domain #
A world state is the set of alien types realized by at least one alien, a nonempty set of vertices of the triangle.
Equations
- FrankeBergen2020.World = { s : Finset Aristotelian.Triangle // s.Nonempty }
Instances For
Equations
- FrankeBergen2020.instDecidableEqWorld = Subtype.instDecidableEq
Equations
- FrankeBergen2020.instFintypeWorld = Subtype.fintype Finset.Nonempty
Equations
- FrankeBergen2020.instMembershipTriangleWorld = { mem := fun (w : FrankeBergen2020.World) (t : Aristotelian.Triangle) => t ∈ ↑w }
Equations
- FrankeBergen2020.instDecidableMemTriangleWorld t w = Finset.decidableMem t ↑w
Equations
The world with only N-type aliens (each drank none).
Equations
Instances For
The world with N-type and S-type aliens.
Equations
Instances For
The world with N-type and A-type aliens.
Equations
Instances For
The world with all three alien types.
Equations
Instances For
The world with only S-type aliens (each drank some but not all).
Equations
Instances For
The world with S-type and A-type aliens.
Equations
Instances For
The world with only A-type aliens (each drank all).
Equations
Instances For
An EXH operator can be inserted at the whole sentence, the outer quantifier, or the inner quantifier.
- matrix : ExhPosition
- outer : ExhPosition
- inner : ExhPosition
Instances For
Equations
- FrankeBergen2020.instDecidableEqExhPosition x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
A parse is the set of EXH insertion sites.
Equations
Instances For
Equations
The matrix-only parse M.
Equations
Instances For
The outer-only parse O.
Equations
Instances For
The Aristotelian quantifiers make up the utterance vocabulary.
- none : AristQuant
- some : AristQuant
- all : AristQuant
Instances For
Equations
- FrankeBergen2020.instDecidableEqAristQuant x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FrankeBergen2020.instReprAristQuant = { reprPrec := FrankeBergen2020.instReprAristQuant.repr }
Equations
- One or more equations did not get rendered due to their size.
Equations
- FrankeBergen2020.instDecidableEqUtterance x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FrankeBergen2020.instReprUtterance = { reprPrec := FrankeBergen2020.instReprUtterance.repr }
Equations
- One or more equations did not get rendered due to their size.
Equations
Outer quantifier of an utterance.
Equations
- FrankeBergen2020.Utterance.nn.outer = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.ns.outer = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.na.outer = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.sn.outer = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.ss.outer = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.sa.outer = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.an.outer = FrankeBergen2020.AristQuant.all
- FrankeBergen2020.Utterance.as.outer = FrankeBergen2020.AristQuant.all
- FrankeBergen2020.Utterance.aa.outer = FrankeBergen2020.AristQuant.all
Instances For
Inner quantifier of an utterance.
Equations
- FrankeBergen2020.Utterance.nn.inner = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.sn.inner = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.an.inner = FrankeBergen2020.AristQuant.none
- FrankeBergen2020.Utterance.ns.inner = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.ss.inner = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.as.inner = FrankeBergen2020.AristQuant.some
- FrankeBergen2020.Utterance.na.inner = FrankeBergen2020.AristQuant.all
- FrankeBergen2020.Utterance.sa.inner = FrankeBergen2020.AristQuant.all
- FrankeBergen2020.Utterance.aa.inner = FrankeBergen2020.AristQuant.all
Instances For
Alternative quantifiers #
Sentential alternatives (A3a) substitute lexical alternatives per quantifier
position: some ↔ all, and not all for none.
Equations
- FrankeBergen2020.instDecidableEqAltQuant x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FrankeBergen2020.instReprAltQuant = { reprPrec := FrankeBergen2020.instReprAltQuant.repr }
Equations
- One or more equations did not get rendered due to their size.
The scale-mate candidates at a quantifier position of a sentential alternative are the quantifier itself and its lexical alternatives.
Equations
- FrankeBergen2020.AristQuant.none.altCandidates = [FrankeBergen2020.AltQuant.none, FrankeBergen2020.AltQuant.notAll]
- FrankeBergen2020.AristQuant.some.altCandidates = [FrankeBergen2020.AltQuant.some, FrankeBergen2020.AltQuant.all]
- FrankeBergen2020.AristQuant.all.altCandidates = [FrankeBergen2020.AltQuant.all, FrankeBergen2020.AltQuant.some]
Instances For
Compositional semantics #
An alien of a given type satisfies "drank Q" according to its place on the scale, some holding above the bottom vertex and all at the top one.
Equations
- FrankeBergen2020.AltQuant.none.sat = fun (x : Aristotelian.Triangle) => x = ⊥
- FrankeBergen2020.AltQuant.some.sat = fun (x : Aristotelian.Triangle) => ⊥ < x
- FrankeBergen2020.AltQuant.all.sat = fun (x : Aristotelian.Triangle) => x = ⊤
- FrankeBergen2020.AltQuant.notAll.sat = fun (x : Aristotelian.Triangle) => x < ⊤
Instances For
Equations
- FrankeBergen2020.instDecidablePredTriangleSat FrankeBergen2020.AltQuant.none x✝ = FrankeBergen2020.instDecidablePredTriangleSat._aux_1 x✝
- FrankeBergen2020.instDecidablePredTriangleSat FrankeBergen2020.AltQuant.some x✝ = { decide := decide (⊥ ≤ x✝ ∧ ¬x✝ ≤ ⊥), reflects_decide := ⋯ }
- FrankeBergen2020.instDecidablePredTriangleSat FrankeBergen2020.AltQuant.all x✝ = FrankeBergen2020.instDecidablePredTriangleSat._aux_4 x✝
- FrankeBergen2020.instDecidablePredTriangleSat FrankeBergen2020.AltQuant.notAll x✝ = { decide := decide (x✝ ≤ ⊤ ∧ ¬⊤ ≤ x✝), reflects_decide := ⋯ }
Quantifier denotation over the alien types realized in a world.
Equations
- FrankeBergen2020.AltQuant.none.eval x✝¹ x✝ = ∀ t ∈ x✝¹, ¬x✝ t
- FrankeBergen2020.AltQuant.some.eval x✝¹ x✝ = ∃ t ∈ x✝¹, x✝ t
- FrankeBergen2020.AltQuant.all.eval x✝¹ x✝ = ∀ t ∈ x✝¹, x✝ t
- FrankeBergen2020.AltQuant.notAll.eval x✝¹ x✝ = ¬∀ t ∈ x✝¹, x✝ t
Instances For
Equations
- One or more equations did not get rendered due to their size.
- FrankeBergen2020.instDecidableEvalOfDecidablePredTriangle FrankeBergen2020.AltQuant.some x✝² x✝¹ = { decide := decide (∃ (a : Aristotelian.Triangle) (_ : a ∈ ↑x✝²), x✝¹ a), reflects_decide := ⋯ }
- FrankeBergen2020.instDecidableEvalOfDecidablePredTriangle FrankeBergen2020.AltQuant.notAll x✝² x✝¹ = { decide := !decide (∀ x ∈ x✝², x✝¹ x), reflects_decide := ⋯ }
not all is the negation of all, definitionally.
none is the negation of some.
A sentential alternative is a pair of alternative quantifiers.
Instances For
Literal meaning of a sentential alternative.
Equations
- FrankeBergen2020.altLiteral a w = a.1.eval w a.2.sat
Instances For
Literal meaning of an utterance.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Compositional exhaustification #
The sentential alternatives at matrix position (A3a) combine the scale-mate candidates at the two quantifier positions.
Equations
Instances For
After EXH enrichment, when licensed, inner some is conjoined with its not-all implicature
and holds at the IO vertex exactly; Exh(none) and Exh(all) are vacuous.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Equations
- One or more equations did not get rendered due to their size.
A sentential alternative is strictly stronger than the sub-matrix reading when its literal meaning is a proper subset of it (A3b), so an utterance's own literal meaning qualifies when a parse weakens it, as for NS under MI.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
The matrix-exhaustified reading is the sub-matrix reading with the literal meaning of every strictly stronger sentential alternative negated.
Equations
- FrankeBergen2020.matrixExh p u w = (FrankeBergen2020.subMatrix p u w ∧ ∀ a ∈ FrankeBergen2020.matrixAlts u, FrankeBergen2020.StrictlyStronger p u a → ¬FrankeBergen2020.altLiteral a w)
Instances For
Equations
- One or more equations did not get rendered due to their size.
The exhaustified meaning under a parse is the sub-matrix reading, negating the strictly stronger alternatives when M is in the parse and doing so is noncontradictory (eq. A2).
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Truth-table verification (the paper's Table 1) #
One characterization per utterance, total over all eight parses — the paper's row-groups appear as the guards. Each reading is a membership predicate on the world's alien-type set, not a truth vector.
In Table 1, NN excludes N-types, and matrix parses also negate "none drank not all", which is {wA}, the reading of fn. 7 from the alternative not all of none.
In Table 1, NS literally holds at wN alone; inner EXH weakens it to the S-free worlds, whereupon matrix EXH negates the sentence's own now-stronger literal meaning {wN}.
In Table 1, NA excludes A-types, and matrix EXH negates the stronger NS, which is {wN}.
In Table 1, SN requires an N-type, and outer or matrix EXH negates AN, which is {wN}.
In Table 1, SS has five row-groups. Inner EXH requires an S-type, matrix EXH then being vacuous, and adding outer EXH excludes wS; outer EXH alone keeps the mixed worlds, matrix EXH alone pins wNS, and the literal parse excludes wN alone.
In Table 1, SA requires an A-type, and outer or matrix EXH excludes wA.
In Table 1, AN holds at wN alone under every parse.
In Table 1, AS excludes N-types; inner EXH pins wS, and matrix EXH without inner EXH negates AA, excluding wA.
In Table 1, AA holds at wA alone under every parse.
Literal meaning is the empty parse's exhaustified meaning.
⟦SS⟧^M = {wNS}, the reading that "uniquely singles out this world state" in the
discussion of eq. 22 and drives GI's win; the matrix-alone case of table1_ss.
The matrix operator (eq. A2) is not innocent exclusion, since at MOI its strictly-stronger filter is empty and ⟦SS⟧^MOI keeps wSA, which innocent exclusion over the same alternatives excludes.
Every (world, parse) state has a true utterance.
The models #
The reading family and the pooled models #
Each parse gives every utterance an extension, and every model is the speaker and listener of
RSA at a uniform prior over this family. The vanilla model (§3.1) uses the literal parse. In GI
(eq. 21a) and LI (eq. 18a) the speaker chooses an utterance together with a parse and the
listener hears the utterance, while in LU (eq. 11) the lexicon is an argument of the speaker,
who addresses that lexicon's literal listener. The weights agree, so the models differ only in
the position of the latent parameter (p. e86), and ss_m_parse_pref against
perParse_ss_prefers_o turns that difference into diverging predictions.
The extension of an utterance under a parse.
Equations
- FrankeBergen2020.ext p u = Finset.filter (FrankeBergen2020.exhMeaning p u) Finset.univ
Instances For
The literal listener under a parse (eq. 5) is uniform on the extension of the utterance.
Equations
- FrankeBergen2020.literal p = RSA.listener (ProbabilityTheory.uniformOn Set.univ) (RSA.truthful fun (u : FrankeBergen2020.Utterance) => ↑(FrankeBergen2020.ext p u))
Instances For
The speaker under a parse (eq. 7) knows the world and addresses that parse's literal listener.
Equations
- FrankeBergen2020.speaker p α = RSA.speaker α 0 (⇑(FrankeBergen2020.literal p)) MeasureTheory.Measure.dirac
Instances For
The vanilla listener (eq. 9) inverts the speaker of the literal parse.
Equations
- FrankeBergen2020.vanillaListener α = RSA.listener (ProbabilityTheory.uniformOn Set.univ) ⇑(FrankeBergen2020.speaker ∅ α)
Instances For
The GI choice space (eq. 21a) consists of utterance–parse pairs over the full reading family, heard as the utterance.
Equations
- FrankeBergen2020.giSem cl = FrankeBergen2020.ext cl.2 cl.1
Instances For
The GI speaker (eq. 21a) chooses an utterance together with a parse.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The GI listener (eq. 21b) hears the utterance of the speaker's choice and infers the world and the choice.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The GI listener marginalized to worlds.
Equations
Instances For
The GI listener marginalized to the speaker's choice of utterance and parse.
Equations
Instances For
Equations
- FrankeBergen2020.instDecidableEqLIParse x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FrankeBergen2020.instReprLIParse = { reprPrec := FrankeBergen2020.instReprLIParse.repr }
Equations
- One or more equations did not get rendered due to their size.
Equations
Map LI parse to the full parse space.
Equations
Instances For
LI cannot access matrix EXH, since no LI parse includes M.
The LI choice space (eq. 18a) consists of pairs over the matrix-free parses.
Equations
- FrankeBergen2020.liSem cl = FrankeBergen2020.ext cl.2.toParse cl.1
Instances For
The LI speaker (eq. 18a) chooses an utterance together with a matrix-free parse.
Equations
- One or more equations did not get rendered due to their size.
Instances For
The LI listener (eq. 18b), marginalized to worlds.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Lexical uncertainty: the latent as a speaker argument #
An LU lexicon is literal or OI, with inner and outer EXH. Each speaker has a fixed lexicon, and the listener marginalizes over the two lexica.
Instances For
Equations
- FrankeBergen2020.instDecidableEqLULex x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- FrankeBergen2020.instReprLULex = { reprPrec := FrankeBergen2020.instReprLULex.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- One or more equations did not get rendered due to their size.
Equations
Map LU lexicon to the corresponding parse.
Equations
Instances For
LU cannot access matrix EXH, since neither lexicon includes M.
The LU listener (eqs. 12–13) inverts the speaker of eq. 11, who has a fixed lexicon, at a uniform prior over worlds and lexica.
Equations
- FrankeBergen2020.luListener α = RSA.listener (ProbabilityTheory.uniformOn Set.univ) fun (p : FrankeBergen2020.World × FrankeBergen2020.LULex) => (FrankeBergen2020.speaker p.2.toParse α) p.1
Instances For
The rejected architecture: per-parse normalization #
The architecture the paper rejects as "conceptually highly implausible" (p. e85) takes the full parse family with the parse as a speaker argument, eq. 11 with an enlarged latent set rather than the pooled choice of eq. 21a. Its listener inverts the per-parse speaker at a uniform prior over worlds and parses.
Equations
- FrankeBergen2020.perParseListener α = RSA.listener (ProbabilityTheory.uniformOn Set.univ) fun (p : FrankeBergen2020.World × FrankeBergen2020.Parse) => (FrankeBergen2020.speaker p.2 α) p.1
Instances For
The findings #
Exhaustified interpretation #
Hearing "some of the aliens drank some of their water", the pooled listener favors the world where no alien drank all of its water over the one where some did (inner exhaustification).
Hearing "some of the aliens drank some of their water", the pooled listener favors a world where some alien drank nothing (outer exhaustification).
Hearing "all of the aliens drank all of their water", the pooled listener favors the unique world where every alien did just that.
Hearing "all of the aliens drank some of their water", the pooled listener favors the world where every alien drank some but not all (inner exhaustification).
The model comparison #
Hearing "some of the aliens drank some of their water", the literal-semantics listener favors all-drinkers over some-but-not-all drinkers — opposite to the attested preference.
Hearing "some of the aliens drank some of their water", the pooled listener favors some-but-not-all drinkers over all-drinkers, as attested.
Hearing "some of the aliens drank some of their water", the matrix-free pooled listener still favors a world where some alien drank nothing (outer exhaustification).
Hearing "some of the aliens drank some of their water", the matrix-free pooled listener favors some-but-not-all drinkers over all-drinkers.
Hearing "some of the aliens drank some of their water", the lexical-uncertainty listener favors some-but-not-all drinkers over all-drinkers.
The position of the latent parameter #
Hearing "some of the aliens drank some of their water", the pooled listener's parse posterior peaks at exhaustification of the whole sentence.
Hearing "some of the aliens drank some of their water", the per-parse listener favors exhaustifying the outer quantifier over exhaustifying the whole sentence.