Farkas and Bruce (2010): On Reacting to Assertions and Polar Questions #
This file formalizes [FB10]'s account of why reactions to assertions and to polar
questions overlap only in part. The context structure is Commitment.Table: the participants'
discourse commitments, the common ground, and the Table, whose items project the common
grounds that would settle them. A default assertion commits its author, places the declarative
on the Table and projects confirmation alone (9); a default polar question places the
interrogative on the Table and projects both resolutions (12). So an assertion leaves the
common ground as it was, unlike [Sta78]'s update (Table.commonGround_assert,
assert_not_narrowing);
the two moves differ in whether the author is committed and in whether the projected set is
inquisitive (projectedSet_assert, projectedSet_polarQuestion), and agree in deciding the
sentence radical in every projected common ground (Table.mem_of_mem_projectedSet_assert,
Table.mem_or_compl_mem_of_mem_projectedSet_polarQuestion). Confirmation (16) followed by the
common-ground increase M' (17) settles an assertion (shared_assert_confirm,
isStable_settle_assert, mem_commonGround_settle); a total denial (22) leaves nothing
consistent projected and the conversation in crisis (21, Table.inCrisis_assert_assert_compl), from
which agreeing to disagree (23) recovers with the commitments intact
(not_inCrisis_agreeToDisagree,
discourseCommitments_agreeToDisagree). A reverse answer to a polar question
(28) is no crisis (not_inCrisis_polarQuestion_assert_compl), a confirming answer (24)
projects the single common ground with the answer (projectedSet_polarQuestion_assert), and
the questioner's confirmation of it settles the question (isStable_settle_polarQuestion).
§4.3 and §5 classify responding assertions by two features: the relative polarity [same] or
[reverse] of the response to the sentence radical on the Table (31) and the absolute polarity
[+] or [−] of the asserted sentence. Sentence is a radical with its polarity and
Confirming/Reversing the move types (26) and (29) on sentences; the same [reverse] response
is a denial after an assertion and a reverse answer after a question
(inCrisis_reversing_assert, not_inCrisis_reversing_polarQuestion); on the responses of
Discourse.Response the relative polarity is the quotient of the two polarities
(Reversing.iff_relative_eq_negative).
§5.2 says what the polarity particles mark, as sets of responses: the English yes [same] or
[+] and no [reverse] or [−], their double duty (english); the Romanian da [+], nu [−]
and ba [reverse] except in a [reverse, −] answer to a question (romanian); and French si
and German doch the marked combination [reverse, +] (reversePositive). Both English particles
can confirm a negative question, while in Romanian only nu does
(english_confirmsNegativeQuestion, romanian_confirmsNegativeQuestion_iff). rows are the
responding assertions of (4), (5) and (35)–(50), whose particles are the fragments' polarity
particles; every acceptable response is one its English and Romanian particles mark
(english_mem, romanian_mem), si and doch occur in [reverse, +] responses only
(si_doch_mem_reversePositive), and ba is possible in every denial (ba_denial) and required
to be absent from a [reverse, −] answer (ba_not_reverse_answer_neg).
Implementation notes #
- The Table records the issue a sentence raises, not its syntactic object, so a negative polar
question raises the same issue as its positive counterpart (15),
Question.polar_compl, and the relative polarity of a response is computed from the sentences of the exchange rather than read off the Table. M'isTable.settle, which strips the shared proposition from the individual commitment lists as (17) prescribes; the projected set is derived from the Table rather than stored, as the paper notes it can be.- Rows record the polarities of the initiating and responding sentences as a
Discourse.Response; since a responding assertion shares its radical with the initiating sentence, [same] is agreement of polarity and [reverse] its reversal. - The paper discusses only si of the French particles and only doch of the German ones, so what they mark is a named set rather than an interpretation of the whole fragment.
TODO #
- (5) accepts a bare nu denial of a positive assertion that (42) stars, so §5.2's claim that
ba is required in a [reverse, −] denial is left as the weaker
ba_denial. - Example and section numbers follow the 2009 preprint; UNVERIFIED against the numbering of the journal version.
References #
Total denial (22): the speaker asserts p and the addressee asserts its negation.
Equations
Instances For
Default assertions and default polar questions #
A world can survive the assertion of p without satisfying p, since only the projected set
moves; Commitment.Table is not a HasAssertion instance under its own assert.
(8): from a stable context an assertion projects the single common ground with p, a
categorical bias towards confirmation.
(11): from a stable context a polar question projects both resolutions, an inquisitive context.
Confirmation, denial, and agreeing to disagree #
(17): the shared proposition enters the common ground.
(17): the settled assertion is popped, and from a stable context the Table is empty again.
(23): agreeing to disagree removes the contradictory pair from the Table, and with a consistent common ground the crisis is over.
(23): each participant stays committed to what they asserted.
Reacting to a polar question #
A resolving answer to a polar question projects the single common ground with the answer: the projected resolution inconsistent with it is discarded.
(27): a reverse answer is no crisis, since the question projected both resolutions.
(24) then (16): the questioner's confirmation of the answer settles the question.
Responding assertions and polarity features #
(26): a response confirms when it commits to the proposition of the sentence on the Table.
Equations
- FarkasBruce2010.Confirming s t = (t.prop = s.prop)
Instances For
(29): a response reverses when it commits to the complement of that proposition.
Equations
- FarkasBruce2010.Reversing s t = (t.prop = s.propᶜ)
Instances For
With a shared radical, a response to either move reverses iff its relative polarity is negative: [reverse].
With a shared radical, a response to either move confirms iff its relative polarity is positive: [same].
A [reverse] response to an assertion is a denial: the conversation is in crisis.
The same [reverse] response to the polar question is a reverse answer: no crisis.
Polarity particles #
What the English particles mark (§5.2): yes [same] or [+], no [reverse] or [−].
Equations
Instances For
What the Romanian particles mark (§5.2): da [+], nu [−], and ba [reverse], except in a [reverse, −] answer to a question, where it is impossible (43).
Equations
- One or more equations did not get rendered due to their size.
- FarkasBruce2010.romanian Romanian.PolarityParticle.da = {x : Discourse.Response | x.polarity = Polarity.positive}
- FarkasBruce2010.romanian Romanian.PolarityParticle.nu = {x : Discourse.Response | x.polarity = Polarity.negative}
Instances For
[reverse, +], the combination French si and German doch mark (46)–(49).
Equations
- FarkasBruce2010.reversePositive = {x : Discourse.Response | x.relative = Polarity.negative ∧ x.polarity = Polarity.positive}
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.
Equations
- FarkasBruce2010.instDecidablePredResponseMemSetReversePositive x✝ = { decide := decide (x✝.relative = Polarity.negative) && decide (x✝.polarity = Polarity.positive), reflects_decide := ⋯ }
Both English particles confirm a negative: no as [−], Is Sam not home? — No, he isn't (35), and yes as [same], Sam is not home. — Yes. He is not. (38).
Of the Romanian particles only the absolute nu confirms a negative; da marks [+] and ba [reverse].
The examples #
The polarity particles of the paper's examples, from the fragments of the four languages.
- en (p : English.PolarityParticle) : Particle
- ro (p : Romanian.PolarityParticle) : Particle
- fr (p : French.PolarityParticle) : Particle
- de (p : German.PolarityParticle) : Particle
Instances For
Equations
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.en a) (FarkasBruce2010.Particle.en b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.en p) (FarkasBruce2010.Particle.ro p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.en p) (FarkasBruce2010.Particle.fr p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.en p) (FarkasBruce2010.Particle.de p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.ro p) (FarkasBruce2010.Particle.en p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.ro a) (FarkasBruce2010.Particle.ro b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.ro p) (FarkasBruce2010.Particle.fr p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.ro p) (FarkasBruce2010.Particle.de p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.fr p) (FarkasBruce2010.Particle.en p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.fr p) (FarkasBruce2010.Particle.ro p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.fr a) (FarkasBruce2010.Particle.fr b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.fr p) (FarkasBruce2010.Particle.de p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.de p) (FarkasBruce2010.Particle.en p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.de p) (FarkasBruce2010.Particle.ro p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.de p) (FarkasBruce2010.Particle.fr p_1) = isFalse ⋯
- FarkasBruce2010.instDecidableEqParticle.decEq (FarkasBruce2010.Particle.de a) (FarkasBruce2010.Particle.de b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FarkasBruce2010.instReprParticle = { reprPrec := FarkasBruce2010.instReprParticle.repr }
A responding assertion of the paper's examples: the response, its particles, and the judgment.
- response : Discourse.Response
- particles : List Particle
- judgment : Judgment
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FarkasBruce2010.instReprRow = { reprPrec := FarkasBruce2010.instReprRow.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
Equations
- FarkasBruce2010.moveTable = [("assertion", Discourse.InitiatingMove.assertion), ("question", Discourse.InitiatingMove.polarQuestion)]
Instances For
Equations
- FarkasBruce2010.polarityTable = [("positive", Polarity.positive), ("negative", Polarity.negative)]
Instances For
The particles of each language, by Glottocode and spelling.
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.
Instances For
Equations
- FarkasBruce2010.rows = List.filterMap FarkasBruce2010.Row.ofDatum FarkasBruce2010.Examples.all
Instances For
Every acceptable response is one its English particles mark.
Every acceptable response is one its Romanian particles mark.
ba is possible in every denial.
In a Romanian [reverse, −] answer to a question, ba is impossible and its absence acceptable.
French si and German doch mark the combination [reverse, +], after assertions and questions alike.