Francik and Clark (1985): How to Make Requests That Overcome Obstacles to Compliance #
This file formalizes [FC85]'s obstacle model of requests for information. The
speaker estimates the greatest potential obstacle to getting the information, a preparatory
condition of [Sea69] that may fail, and overcomes it with a request conditional on that
condition, as Do you remember what time the concert begins? means "if you remember, tell me"
and is void if the answer is no. Conditions are ordered by specificity (PreparatoryCondition):
having read the announcement is a way of knowing the time, which is a way of being able to tell
it, so Did you happen to read in the newspaper when the lecture is?, Do you know when the
lecture is? and Can you tell me when the lecture is? overcome the same obstacle with
decreasing specificity. A request Overcomes an obstacle, the set of doubted conditions, when
each lies in the scope of its Query: empty for a direct request, the queried condition and
every way of satisfying it for a conditional request, and everything for the general Can you
tell me? and Could you tell me?, whose excuse is that the hearer is somehow unable or
unwilling. A direct request overcomes no obstacle (overcomes_direct_iff), and a request whose
scope misses the obstacle presupposes what is in doubt: Do you happen to know your middle
name? presupposes willingness, Do you want to tell me what time the lecture is? knowledge.
The speaker is as specific as the situation allows: a request Pinpoints the obstacle when it
is the least that overcomes it, which for a conditional request means the queried condition is
the least upper bound of the doubted ones (pinpoints_condition_iff) and for the general request
that no single condition bounds them (pinpoints_general_iff), as when a stranger asked for
directions may be unable or unwilling.
Three experiments support the model. In Experiment 1 thirty speakers formulated requests for
twenty-four scenarios in a high- and a low-obstacle version, twelve on the hearer's ability,
eight on willingness and four on the speaker's memory of having asked already; direct requests
fell from 49% to 35% with the obstacle (Table 1), and the indirect forms named the obstacle of
the scenario, Do you know? where knowledge was in doubt, Do you remember? where memory was,
Did you see? where the source was and Have I asked you? where the speaker's memory was,
while in the permission and willingness scenarios speakers preferred the general Could you? or
sidestepped the obstacle by asking for related information. Experiment 2 ranked the forms for
directness; Table 2 gives the nine forms for asking the time of a student with or without a
watch, the direct What time is it? produced only with the watch and every form produced
without it overcoming the doubt (time_produced_overcomes). In Experiment 3 eighteen raters
judged five forms in every scenario: each conditional form was rated higher, at either obstacle
level, in the scenario type whose obstacle it overcomes than in those whose obstacle it does not
(ratings_crossover), and the general forms, preferred overall, were rated lower at the high
level than at the low (ratings_general_lt), as forms that pinpoint no single condition. The
requests the paper discusses are predicted by Overcomes (rows_predicted), and its gradient
of specificity descends the order on queries (gradient_antitone).
Implementation notes #
- Can you tell me? and Could you tell me? are the general query rather than the ability condition, following the paper's gloss of their excuse as "somehow unable or unwilling" and its finding that they stay appropriate in the speaker-memory scenarios. No form in the data queries the bare ability condition, which describes the obstacle of a speaker unsure whether the hearer could find out the information, remember it or be allowed to tell it.
- Table 3 pools the knowledge, memory, source and permission scenarios as the ability type; its rows carry knowledge as the type's obstacle. Ratings are recorded in hundredths of a point and directness scores in tenths; sidestepping and politeness stay in the prose.
- The examples are
Data.Examples.FrancikClark1985.
References #
What a request asks about: nothing, one preparatory condition, or anything that could stand in the way (Can you tell me?, Could you tell me?).
- direct : Query
- condition (c : Discourse.SpeechAct.PreparatoryCondition) : Query
- general : Query
Instances For
Equations
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.direct FrancikClark1985.Query.direct = isTrue ⋯
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.direct (FrancikClark1985.Query.condition c) = isFalse ⋯
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.direct FrancikClark1985.Query.general = isFalse FrancikClark1985.instDecidableEqQuery.decEq._proof_4
- FrancikClark1985.instDecidableEqQuery.decEq (FrancikClark1985.Query.condition c) FrancikClark1985.Query.direct = isFalse ⋯
- FrancikClark1985.instDecidableEqQuery.decEq (FrancikClark1985.Query.condition a) (FrancikClark1985.Query.condition b) = if h : a = b then h ▸ isTrue ⋯ else isFalse ⋯
- FrancikClark1985.instDecidableEqQuery.decEq (FrancikClark1985.Query.condition c) FrancikClark1985.Query.general = isFalse ⋯
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.general FrancikClark1985.Query.direct = isFalse FrancikClark1985.instDecidableEqQuery.decEq._proof_8
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.general (FrancikClark1985.Query.condition c) = isFalse ⋯
- FrancikClark1985.instDecidableEqQuery.decEq FrancikClark1985.Query.general FrancikClark1985.Query.general = isTrue ⋯
Instances For
Equations
- FrancikClark1985.instReprQuery = { reprPrec := FrancikClark1985.instReprQuery.repr }
Equations
- One or more equations did not get rendered due to their size.
Instances For
The conditions whose failure voids the request: the queried condition and every way of satisfying it.
Equations
- FrancikClark1985.Query.direct.scope = ∅
- (FrancikClark1985.Query.condition c).scope = Set.Iic c
- FrancikClark1985.Query.general.scope = Set.univ
Instances For
Equations
- FrancikClark1985.Query.direct.instDecidablePredPreparatoryConditionMemSetScope x✝ = isFalse ⋯
- (FrancikClark1985.Query.condition c).instDecidablePredPreparatoryConditionMemSetScope x✝ = FrancikClark1985.Query.instDecidablePredPreparatoryConditionMemSetScope._aux_1 c x✝
- FrancikClark1985.Query.general.instDecidablePredPreparatoryConditionMemSetScope x✝ = isTrue ⋯
Queries are ordered by scope, the direct request at the bottom and the general at the top.
Equations
Equations
- q.instDecidableLE q' = decidable_of_iff (∀ c ∈ q.scope, c ∈ q'.scope) ⋯
Equations
- One or more equations did not get rendered due to their size.
The request overcomes the obstacle O, the conditions the speaker doubts, when it is
conditional on each of them.
Equations
- FrancikClark1985.Overcomes q O = (O ⊆ q.scope)
Instances For
The request pinpoints the obstacle when it is the least request that overcomes it.
Equations
- FrancikClark1985.Pinpoints q O = IsLeast {q : FrancikClark1985.Query | FrancikClark1985.Overcomes q O} q
Instances For
A direct request overcomes no obstacle.
A conditional request overcomes the obstacles its condition bounds.
The general request overcomes every obstacle.
Equations
- FrancikClark1985.instDecidableOvercomesSingletonPreparatoryConditionSet = decidable_of_iff (c ∈ q.scope) ⋯
The principle of specificity: the conditional request that pinpoints an obstacle queries the least condition that every doubted condition is a way of satisfying.
The general request pinpoints exactly the obstacles no single condition bounds, as when the speaker cannot tell whether the hearer is unable or unwilling.
The paper's data #
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
A request the paper discusses: its query, the greatest potential obstacle in its scenario, whether the paper finds it appropriate, and whether it belongs to the gradient of specificity.
- query : Query
- obstacle : Discourse.SpeechAct.PreparatoryCondition
- appropriate : Bool
- gradient : Bool
Instances For
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
Instances For
The requests the paper finds appropriate are those that overcome the obstacle.
A form of Table 2, asking the time of a student without a watch (the high obstacle) or with one (the low), with the number of the fifteen speakers at each level who produced it.
- query : Query
- high : ℕ
- low : ℕ
Instances For
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
Instances For
Every form produced without the watch overcomes the doubt that the student can find out the time; the direct What time is it? was produced only with it.
A cell of Table 3: a form's query, the obstacle of the scenario type, and its mean appropriateness rating at the high and low obstacle levels, in hundredths of a point.
- query : Query
- obstacle : Discourse.SpeechAct.PreparatoryCondition
- high : ℕ
- low : ℕ
Instances For
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
Instances For
Each form is rated higher, at either level, in the scenario type whose obstacle it overcomes than in those whose obstacle it does not.
The general forms are rated lower at the high obstacle level: they overcome every obstacle
(overcomes_general) but pinpoint no single condition (pinpoints_general_iff).