Documentation

Studies.FrancikClark1985

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 #

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?).

Instances For
    def FrancikClark1985.instReprQuery.repr :
    Query → ℕ → Std.Format
    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
      Instances For
        @[instance_reducible]

        Queries are ordered by scope, the direct request at the bottom and the general at the top.

        Equations
        theorem FrancikClark1985.Query.le_def {q q' : Query} :
        q ≤ q' ↔ q.scope ⊆ q'.scope
        @[instance_reducible]
        Equations
        @[instance_reducible]
        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
        Instances For

          The request pinpoints the obstacle when it is the least request that overcomes it.

          Equations
          Instances For

            A direct request overcomes no obstacle.

            A conditional request overcomes the obstacles its condition bounds.

            The general request overcomes every obstacle.

            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 #

            def FrancikClark1985.queries :
            List (String × Query)
            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.

                Instances For
                  def FrancikClark1985.instDecidableEqRow.decEq (x✝ x✝¹ : Row) :
                  Decidable (x✝ = x✝¹)
                  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
                      theorem FrancikClark1985.rows_predicted (r : Row) :
                      r ∈ rows → (r.appropriate = true ↔ Overcomes r.query {r.obstacle})

                      The requests the paper finds appropriate are those that overcome the obstacle.

                      theorem FrancikClark1985.gradient_antitone :
                      List.Pairwise (fun (x1 x2 : Query) => x1 ≥ x2) (List.map Row.query (List.filter (fun (x : Row) => x.gradient) rows))

                      The gradient of specificity descends the order on queries.

                      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
                        def FrancikClark1985.instDecidableEqTimeForm.decEq (x✝ x✝¹ : TimeForm) :
                        Decidable (x✝ = x✝¹)
                        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

                            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.

                            Instances For
                              def FrancikClark1985.instDecidableEqRating.decEq (x✝ x✝¹ : Rating) :
                              Decidable (x✝ = x✝¹)
                              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
                                  theorem FrancikClark1985.ratings_crossover (r : Rating) :
                                  r ∈ ratings → ∀ r' ∈ ratings, r.query = r'.query → Overcomes r.query {r.obstacle} → ¬Overcomes r'.query {r'.obstacle} → r'.high < r.high ∧ r'.low < r.low

                                  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).