Docs / Pragmatics / Probabilistic / Incremental

Incremental RSA: string meanings and the incremental speaker

import Linglib.Pragmatics.Probabilistic.Incremental · namespace RSA

Incremental rational speech act models run the pipeline word by word. In the model of Cohn-Gordon, Goodman and Potts an incomplete string gets its meaning from the complete utterances that continue it, the speaker chooses each word, or the end of the utterance, against a listener of the string so far, and the probability of an utterance is the product of her choices along it: she is an autoregressive sequence model, who chooses each word as the word-level speaker does. With graded word meanings the value of an utterance is the product of the values of its words, whatever their order, as in the models of Waldon and Degen and of Schlotterbeck and Wang.

References

Declarations

L54
L56–58

The value of a word sequence does not depend on the order of its words.

theorem prodMeaning_permL60–63
{U : Type u_1} {W : Type u_2} {R : Type u_3} [CommMonoid R] {lex : U → W → R} {us us' : List U} (h : us.Perm us') (w : W) :
prodMeaning lex us w = prodMeaning lex us' w

Built from

L71–73
L81–85

String meanings

The meaning of a prefix is the mean of the utterance meaning over the complete utterances that continue it. A prefix with no continuation has meaning zero.

stringMeaningL99–103
noncomputable def RSA.stringMeaning {U : Type u_1} {W : Type u_2} [DecidableEq U] (utts : List (List U)) (m : List U → W → ℝ) (pfx : List U) (r : W) :
ℝ

Built from

Used by stringMeaning_nonneg, stringMeaning_pos, stringMeaning_of_continuations_eq_nil, stringMeaning_of_continuations_eq_singleton, stringMeaning_eq_of_perm_map, incrementalMeaning

L105–109
L111–116
L118–120
L122–124
L126–139

The end of the utterance

L150–151
L153–156
L158–177
L179–181
L183–185
L187–196
L198–202

The incremental speaker

The incremental speaker for r is the autoregressive sequence model whose choice after each context c is the word-level speaker's, S c r, over the next word and the end of the utterance. A context where she has no choice ends the string.

incrementalSpeakerL216–226
noncomputable def RSA.incrementalSpeaker {U : Type u_1} {W : Type u_2} [MeasurableSpace U] [Countable U] [MeasurableSpace W] (S : List U → ProbabilityTheory.Kernel W (Option U)) (r : W) :

The definition is too large to print here; read it in the source.

Used by next_incrementalSpeaker, next_incrementalSpeaker_of_ne_zero, next_incrementalSpeaker_apply_some

Used in CohnGordonEtAl2019, WaldonDegen2021

L228–231
L233–237

The incremental speaker chooses each word as the word-level speaker does.

theorem next_incrementalSpeaker_apply_someL239–248
{U : Type u_1} {W : Type u_2} [MeasurableSpace U] [Countable U] [MeasurableSpace W] {S : List U → ProbabilityTheory.Kernel W (Option U)} {r : W} {c : List U} [MeasurableSingletonClass U] [MeasureTheory.IsZeroOrProbabilityMeasure ((S c) r)] (a : U) :
((incrementalSpeaker S r).next c) {some a} = ((S c) r) {some a}

Built from