Franke & Bergen 2020: grammatically generated implicature readings #
[FB20b] compares four RSA models ([FG12]) of the
nested Aristotelians "Q₁ of the aliens drank Q₂ of their water"
(Q ∈ {none, some, all}). An alien's drinking amount is a SomeAllWorld; a
world state is the nonempty set of amounts realized by at least one alien
(7 states); a parse is the set of EXH insertion sites among matrix/outer/inner
(8 parses); the readings are the paper's Table 1 (the table1_* lemmas, one
per row, each characterized by a membership predicate). The models differ in where
the parse enters the speaker: vanilla (§3.1) has only the literal parse; LU
(§3.2) fixes a lexicon l ∈ {lit, OI} per speaker — the parse an argument
of the speaker (eq. 11) and a latent the listener marginalizes
([BLG16], [PLLF16]); the LI (§3.3) and GI (§3.4)
speakers instead choose an (utterance, parse) pair (eqs. 18a/21a), over the
4 matrix-free parses resp. all 8 — one softmax over pairs per world, heard
through the RSA.Scenario observation map.
We show that GI corrects the SS interpretation vanilla gets wrong
(vanilla_ss_prefers_wNA vs gi_ss_prefers_wNS), and that its parse
posterior for SS peaks at the matrix-only parse (ss_m_parse_pref), whose
reading ⟦SS⟧^M = {wNS} "uniquely singles out this world state" (eq. 22,
m_ss_singleton) and is unavailable to LI and LU (li_excludes_matrix,
lu_excludes_matrix) — the paper's explanation of GI's win in its Bayesian
model comparison (posterior 0.956 vs LI 0.033, LU 0.01, vanilla 0; Table 2).
The M-advantage exists because the pooled speaker normalizes over pairs:
under the per-parse normalization the paper rejects (p. e85), O beats M at
every rationality (perParse_ss_prefers_o). LI and LU still derive the
embedded enrichments (li_ss_outer_exh, li_ss_prefers_wNS,
lu_ss_prefers_wNS).
Main results #
table1_*— the paper's Table 1, one lemma per row, including NN's distinct matrix row (fn. 7) from thenone ~ not alllexical alternative ([Lev00]).ss_m_parse_prefvsperParse_ss_prefers_o— the architectural headline: pooled (utterance, parse) choice peaks at M (α = 5), per-parse normalization prefers O for every rationality. WithRSA.Scenario.pool_L0(identical weights), the pair locates GI's win purely in the position of the latent parameter (p. e86).moi_ss_ne_innocent_exclusion— the paper's matrix operator (eq. A2) is not Fox-style innocent exclusion ([Fox07]).
Implementation notes #
One reading family (readings) generates every model: vanilla is its
literal member, GI and LI pool (utterance, parse) pairs into the choice
space (RSA.Scenario.pool, eqs. 18a/21a), and LU — like the rejected
per-parse architecture — fixes the latent as a speaker argument
(RSA.Scenario.familySpeaker, eq. 11). Sentential alternatives (A3a) range
over a fourth quantifier notAll that is never an utterance — the paper's
grammatical-vs-utterance alternatives distinction (its comparison with
[GR18]'s alternative set favors this one by a Bayes factor of
~1,530). Findings come in two registers, both closed by decide:
Multiset.StrictDominates certificates — strict stochastic dominance of
informativity profiles — hold for every rationality α > 0, while genuinely
α-dependent findings are pinned at the paper's illustrative α = 5, where
comparisons clear to ℕ inequalities via Multiset.divPowSum. We omit the
paper's cost term for none-initial utterances and fixed error ε = 0.045
(eqs. 25–28); vanilla_ss_prefers_wNA reverses at the fitted cost. The
paper's S2/L2 layer for LU ([LG17], eqs. 14a–14b) is also
omitted: our L1-only LU keeps wNS over wNA at every rationality, though the
paper's LU-L2 concentrates on wNSA (eq. 15).
The grammar of readings #
Domain #
An alien's drinking amount: none, some but not all, or all of its water.
Equations
Instances For
A world state is the set of drinking amounts realized by at least one alien — a nonempty subset of the three amounts.
Equations
- FrankeBergen2020.World = { s : Finset FrankeBergen2020.AlienType // s.Nonempty }
Instances For
Equations
- FrankeBergen2020.instDecidableEqWorld = Subtype.instDecidableEq
Equations
- FrankeBergen2020.instFintypeWorld = Subtype.fintype Finset.Nonempty
Equations
- FrankeBergen2020.instMembershipAlienTypeWorld = { mem := fun (w : FrankeBergen2020.World) (t : FrankeBergen2020.AlienType) => t ∈ ↑w }
Equations
- FrankeBergen2020.instDecidableMemAlienTypeWorld t w = Finset.decidableMem t ↑w
Equations
The world with only N-type aliens (each drank none).
Equations
- FrankeBergen2020.wN = ⟨{SomeAllWorld.none}, ⋯⟩
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
- FrankeBergen2020.wA = ⟨{SomeAllWorld.all}, ⋯⟩
Instances For
EXH insertion sites: applying to 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
Aristotelian quantifiers: 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
- FrankeBergen2020.instReprUtterance = { reprPrec := FrankeBergen2020.instReprUtterance.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
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
- FrankeBergen2020.instReprAltQuant = { reprPrec := FrankeBergen2020.instReprAltQuant.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.
Scale-mate candidates at a quantifier position of a sentential alternative: 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 #
Satisfaction of "drank Q" by an alien of a given amount, via the
SomeAllWorld meanings.
Equations
Instances For
Equations
- FrankeBergen2020.instDecidablePredAlienTypeSat FrankeBergen2020.AltQuant.none x✝ = FrankeBergen2020.instDecidablePredAlienTypeSat._aux_1 x✝
- FrankeBergen2020.instDecidablePredAlienTypeSat FrankeBergen2020.AltQuant.some x✝ = FrankeBergen2020.instDecidablePredAlienTypeSat._aux_3 x✝
- FrankeBergen2020.instDecidablePredAlienTypeSat FrankeBergen2020.AltQuant.all x✝ = FrankeBergen2020.instDecidablePredAlienTypeSat._aux_5 x✝
- FrankeBergen2020.instDecidablePredAlienTypeSat FrankeBergen2020.AltQuant.notAll x✝ = FrankeBergen2020.instDecidablePredAlienTypeSat._aux_7 x✝
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
- FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType FrankeBergen2020.AltQuant.none x✝² x✝¹ = FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType._aux_1 x✝² x✝¹ x✝
- FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType FrankeBergen2020.AltQuant.some x✝² x✝¹ = FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType._aux_3 x✝² x✝¹ x✝
- FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType FrankeBergen2020.AltQuant.all x✝² x✝¹ = FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType._aux_5 x✝² x✝¹ x✝
- FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType FrankeBergen2020.AltQuant.notAll x✝² x✝¹ = FrankeBergen2020.instDecidableEvalOfDecidablePredAlienType._aux_7 x✝² x✝¹ x✝
not all is the negation of all — definitionally, where the Bool version transcribed the negated clause by hand.
none is the negation of some.
A sentential alternative: 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 #
Sentential alternatives at matrix position (A3a): scale-mate candidates at the two quantifier positions.
Equations
Instances For
Inner satisfaction after EXH enrichment: when licensed, EXH conjoins
some with its not-all implicature — the .someNotAll amount exactly;
Exh(none) and Exh(all) are vacuous.
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
A sentential alternative is strictly stronger than the sub-matrix reading (A3b: proper subset — 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
The matrix-exhaustified reading: the sub-matrix reading with every strictly stronger sentential alternative's literal meaning 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
Exhaustified meaning under a parse: 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
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.
Table 1, NN: no N-types; matrix parses additionally negate "none drank
not all" (= {wA}) — the fn. 7 reading from the none ~ not all alternative.
Table 1, NS: only wN literally; inner EXH weakens to the S-free worlds, whereupon matrix EXH negates the sentence's own now-stronger literal {wN}.
Table 1, NA: no A-types; matrix EXH negates the stronger NS = {wN}.
Table 1, SN: an N-type exists; outer or matrix EXH negates AN = {wN}.
Table 1, SS: the five row-groups — literal; inner EXH requires an S-type (matrix then vacuous); adding outer EXH excludes wS; outer alone keeps mixed worlds; matrix alone pins wNS.
Table 1, SA: an A-type exists; outer or matrix EXH excludes wA.
Table 1, AN: only wN, under every parse.
Table 1, AS: no N-types; inner EXH pins wS; matrix EXH without inner negates AA, excluding wA.
Table 1, AA: only wA, under every parse.
Literal meaning is the empty parse's exhaustified meaning.
⟦SS⟧^M = {wNS} — the reading that "uniquely singles out this world
state" (eq. 22) and drives GI's win; the matrix-alone case of table1_ss.
The matrix operator (eq. A2) is not Fox-style innocent exclusion ([Fox07]): 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 yields a scenario (readings); the paper's models are combinators
applied to this single family. Vanilla (§3.1) is the literal member. GI
(eq. 21a) and LI (eq. 18a) pool (utterance, parse) pairs into one choice
space — the speaker chooses the parse — while LU (eq. 11) fixes the lexicon
as a speaker argument (RSA.Scenario.familySpeaker). By
RSA.Scenario.pool_L0 the weights agree, so the models differ only in the
position of the latent parameter (p. e86); ss_m_parse_pref against
perParse_ss_prefers_o below turns that difference into diverging
predictions. Rationality is a parameter of the derived kernels, and findings
quantify over it wherever the paper's argument does.
The extension of an utterance under a parse, as a Finset — the
RSA.Scenario semantic field.
Equations
- FrankeBergen2020.ext p u = Finset.filter (FrankeBergen2020.exhMeaning p u) Finset.univ
Instances For
One scenario per parse: utterances read under it.
Equations
- FrankeBergen2020.readings p = { sem := FrankeBergen2020.ext p, obs := id }
Instances For
The vanilla scenario (§3.1): the literal member of the family.
Equations
Instances For
The GI scenario (eq. 21a): pair choice over the full reading family.
Instances For
Equations
- FrankeBergen2020.instDecidableEqLIParse x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯
Equations
- FrankeBergen2020.instReprLIParse = { reprPrec := FrankeBergen2020.instReprLIParse.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 LI parse to the full parse space.
Equations
Instances For
LI cannot access matrix EXH: no LI parse includes M.
The LI scenario (eq. 18a): pair choice over the matrix-free parses.
Equations
Instances For
Equations
- FrankeBergen2020.prior = ProbabilityTheory.uniformOn Set.univ
Instances For
Lexical uncertainty: the latent as a speaker argument #
LU lexicon: literal or OI (inner + outer EXH). Each speaker has a fixed lexicon; 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
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FrankeBergen2020.instReprLULex = { reprPrec := FrankeBergen2020.instReprLULex.repr }
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: neither lexicon includes M.
LU's joint prior: the lexicon is drawn with the world.
Equations
- FrankeBergen2020.luPrior = ProbabilityTheory.uniformOn Set.univ
Instances For
LU listener (eqs. 12–13): Bayesian inverse over the joint state.
Equations
Instances For
The rejected architecture: per-parse normalization #
The architecture the paper rejects as "conceptually highly implausible" (p. e85): the full parse family with the parse as a speaker argument — eq. 11 with an enlarged latent set, rather than eq. 21a's pooled choice.
Equations
- FrankeBergen2020.perParsePrior = ProbabilityTheory.uniformOn Set.univ
Instances For
Listener of the rejected architecture: the Bayesian inverse of the per-parse speaker over the joint (world, parse) state.
Equations
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.