The online processing of semantic and pragmatic content Brian - - PDF document

the online processing of semantic and pragmatic content
SMART_READER_LITE
LIVE PREVIEW

The online processing of semantic and pragmatic content Brian - - PDF document

The online processing of semantic and pragmatic content Brian Dillon LINGUIST510 Psycholinguistics Comprehension: How do we compute the meaning of a sentence in real time? What are the online computations that we use to map word strings to


slide-1
SLIDE 1

The online processing of semantic and pragmatic content

Brian Dillon

LINGUIST510

slide-2
SLIDE 2

Psycholinguistics

Comprehension: How do we compute the meaning of a sentence in real time? What are the online computations that we use to map word strings to structured meanings when reading or listening? words grammatical knowledge (extra-)linguistic context memory attention [[words]]

slide-3
SLIDE 3

Psycholinguistics

Some students enjoy psycholinguistics.

  • What is the grammatical / cognitive

mechanism that achieves (scalar) implicature?

slide-4
SLIDE 4

The Garden Path

The horse raced past the barn fell BEVER (1970)

slide-5
SLIDE 5

The Garden Path

The horse raced past the barn fell BEVER (1970)

  • Syntactic analysis proceeds incrementally
  • The ‘main verb’ parse of ‘raced’ is

preferred over the ‘reduced relative’ parse

slide-6
SLIDE 6

The Garden Path

The horse raced past the barn fell

  • Garden Path Theory: main verb analysis is preferred

because it is structurally simpler: there are fewer syntactic nodes/phrases to postulate on MV analysis. So it is computed more rapidly, and becomes the parse we initially adopt.

slide-7
SLIDE 7

The Garden Path

The horse raced past the barn fell

  • Pragmatic Theory (?): main verb analysis is in some

sense “pragmatically preferred” over reduced relative analysis (in the so-called ‘null context’). Such a theory would imply that pragmatic computations

  • ccur incrementally.
slide-8
SLIDE 8

The Garden Path

RR: [NP The [RC horse raced … ] ] MV: [NP The horse] raced …

  • What are presuppositions, implicatures

generated by this (partial) parse?

  • What are presuppositions, implicatures

generated by this (partial) parse? Suppose that comprehenders incrementally interpret sentences, including presuppositions, implicatures. Then…

slide-9
SLIDE 9

The Garden Path

RR: [NP The horse raced … ] … MV: [NP The horse] raced … There’s a (unique) horse There is a (unique) horse which +1) is a member of some larger set of horses. +2) This horse was raced somewhere and +3) the other horses weren’t raced to this place…

slide-10
SLIDE 10

The Referential Theory

RR: [NP The horse raced … ] … MV: [NP The horse] raced … Principle of Parsimony (Crain & Steedman 1985): Parse which carries fewer unsatisfied presuppositions/ entailments (implicatures-BWD) is adopted by hearer, all else being equal. Explains Garden Path effect: RR analysis carries ~3 more unsupported implicatures (in ‘null context’) than MV parse, so is dispreferred.

slide-11
SLIDE 11

The Referential Theory

RR: [NP The horse raced … ] … MV: [NP The horse] raced … Prediction: The probability of experiencing a garden path should decrease with the number of implicatures associated with a reduced relative parse of input string.

slide-12
SLIDE 12

Def: The children taught by the Berlitz Method passed the test. Bare plurals, existential: Children taught by the Berlitz method passed the test Bare plurals, generic: Children taught by the Berlitz method pass the test

Experiment: Use Rapid Serial Visual Presentation (300ms/word), and ask for rapid grammaticality judgment.

The Referential Theory

CRAIN & STEEDMAN (1985)

slide-13
SLIDE 13

The Referential Theory

CRAIN & STEEDMAN (1985) +

slide-14
SLIDE 14

The Referential Theory

CRAIN & STEEDMAN (1985) YOUNGSTERS

slide-15
SLIDE 15

The Referential Theory

CRAIN & STEEDMAN (1985) PUSHED

slide-16
SLIDE 16

The Referential Theory

CRAIN & STEEDMAN (1985) INTO

slide-17
SLIDE 17

The Referential Theory

CRAIN & STEEDMAN (1985) THE

slide-18
SLIDE 18

The Referential Theory

CRAIN & STEEDMAN (1985) COULDN’T

slide-19
SLIDE 19

The Referential Theory

CRAIN & STEEDMAN (1985) MOVE

slide-20
SLIDE 20

The Referential Theory

CRAIN & STEEDMAN (1985) ????

slide-21
SLIDE 21

The Referential Theory

CRAIN & STEEDMAN (1985) +

slide-22
SLIDE 22

The Referential Theory

CRAIN & STEEDMAN (1985) YOUNGSTERS

slide-23
SLIDE 23

The Referential Theory

CRAIN & STEEDMAN (1985) PUSHED

slide-24
SLIDE 24

The Referential Theory

CRAIN & STEEDMAN (1985) INTO

slide-25
SLIDE 25

The Referential Theory

CRAIN & STEEDMAN (1985) THE

slide-26
SLIDE 26

The Referential Theory

CRAIN & STEEDMAN (1985) CROWD

slide-27
SLIDE 27

The Referential Theory

CRAIN & STEEDMAN (1985) COULDN’T

slide-28
SLIDE 28

The Referential Theory

CRAIN & STEEDMAN (1985) MOVE

slide-29
SLIDE 29

The Referential Theory

CRAIN & STEEDMAN (1985) ????

slide-30
SLIDE 30

The Referential Theory

CRAIN & STEEDMAN (1985) % “UNGRAMMATICAL” Responses: Definite heads > Indefinite Existentials > Indefinite Generics (29%)

slide-31
SLIDE 31

The Referential Theory

CRAIN & STEEDMAN (1985) “Syntax proposes, semantics disposes”: The parser incrementally generates a semantic interpretation+presuppositions+implied meaning in parallel for some (maybe all) possible parses, and uses the latter to select a parse for further computation.

slide-32
SLIDE 32

The Referential Theory

Can other linguistic operators introduce contexts that support RR parses fast enough to prevent garden pathing? Focus operator only requires contrast set (viz. focus alternatives). Can a focus operator that needs a contrast introduce bias towards postmodifier parse of ambiguous material?

slide-33
SLIDE 33

The Referential Theory

CRAIN, NI & SHANKWEILER (1996) Bare, Def: The businessmen loaned money at a low interest rate were told to record their expenses. Only, Def: Only the businessmen loaned money at a low interest rate were told to record their expenses.

slide-34
SLIDE 34

The Referential Theory

CRAIN, NI & SHANKWEILER (1996) /(Only) the businessmen/ loaned/ money at a low/ interest rate/ were told/ to record their/ expenses/ Experiment: Self-paced reading. Readers see one section of sentence at a time, and they press a button to advance through the sentence. Reaction times to the button press are recorded; processing difficulty is expected to surface as long reaction times.

slide-35
SLIDE 35

The Referential Theory

CRAIN, NI & SHANKWEILER (1996) /(Only) the businessmen/ loaned/ money at a low/ interest rate/ were told/ to record their/ expenses/ ms

slide-36
SLIDE 36

The Referential Theory

CRAIN, NI & SHANKWEILER (1996) /(Only) the wealthy businessmen/ loaned/ money at a low/ interest rate/ were told/ to record their/ expenses/ ms

slide-37
SLIDE 37

The Visual World

slide-38
SLIDE 38

The Visual World

Recognize “apple” Fixate “apple” 150ms

slide-39
SLIDE 39

Tanenhaus et al (1995)

Ambiguous Instruction: “Put the apple on the towel in the box” Parse 1: “Put [the apple on the towel] in the box” Parse 2: “Put [the apple] [on the towel] in the box”

slide-40
SLIDE 40

Tanenhaus et al (1995)

Unambiguous Instruction: “Put the apple that’s on the towel in the box”

slide-41
SLIDE 41

Tanenhaus et al (1995)

2-Referent Context 1-Referent Context “Put the apple on the towel in the box”

slide-42
SLIDE 42

Tanenhaus et al (1995)

1-Referent Context In 1-referent context with ambiguous instructions, listeners look to incorrect goal (B), suggesting they’ve been garden- pathed.

slide-43
SLIDE 43

Tanenhaus et al (1995)

2-Referent Context In 2-referent context with ambiguous instructions, listeners do not look to incorrect goal (B).

slide-44
SLIDE 44

Tanenhaus et al (1995)

i) uniqueness presupposition for determiner calculated immediately, ii) presupposition immediately evaluated against extra-linguistic (visual) context… iii) … biasing listeners to postmodifier parse of ambiguous PP

slide-45
SLIDE 45

Tanenhaus et al (1995)

Implication: The need to satisfy the uniqueness presupposition of definite the 2-referent context causes comprehenders to anticipate a PP postmodifier!

slide-46
SLIDE 46

‘Continuous referential processing’

So far: Listeners rapidly compute presuppositions and implicatures off of partial input; Use this information to information syntactic parsing decisions; Continuously evaluate presuppositions and implicatures against (extra-)linguistic context

slide-47
SLIDE 47

Scalar implicatures

Question: Why should comprehenders attempt to minimize unsatisfied implicatures a la Parsimony? Why not make ALL the implicatures and just deal with it? Hypothesis: The calculation of an implicature is a cognitive operation with measurable cost; it is to be avoided, all else being equal.

slide-48
SLIDE 48

Some students enjoy psycholinguistics.

Scalar implicatures

Lower-bounded reading: some, maybe all, students like psycholx Upper-bounded reading: some, but not all, students like psycholx

HUANG & SNEDEKER (2009)

slide-49
SLIDE 49

Some students enjoy psycholinguistics.

Scalar implicatures

HUANG & SNEDEKER (2009) Hypothesis: Derivation of upper-bounded reading involves computation of scalar implicature, which requires an extra processing step. Some Some, maybe all

access literal meaning compute scalar implicature

Some, not all

slide-50
SLIDE 50

Some students enjoy psycholinguistics.

Scalar implicatures

HUANG & SNEDEKER (2009) Prediction: We should observe that comprehenders i) are slower to access upper-bounded reading than lower- bounded and ii) should show evidence lower-bounded reading at some point in processing stream. Some Some, maybe all

access literal meaning compute scalar implicature

Some, not all

slide-51
SLIDE 51

Point to the girl that has some/two of the socks…

Scalar implicatures

slide-52
SLIDE 52

Two: Point to the girl that has two …

Scalar implicatures

Only compatible with this referent.

slide-53
SLIDE 53

Some: Point to the girl that has some …

Scalar implicatures

If lower-bound reading computed first, reference is ambiguous here.

slide-54
SLIDE 54

Some: Point to the girl that has some…

Scalar implicatures

If upper-bound reading computed immediately, sentence is only compatible with this referent.

slide-55
SLIDE 55

Three/all: Point to the girl that has three/all of …

Scalar implicatures

Control conditions

slide-56
SLIDE 56

Scalar implicatures

slide-57
SLIDE 57

Scalar implicatures

Some Some, maybe all

access literal meaning compute scalar implicature

Some, not all Hypothesis: Derivation of upper-bounded reading involves computation of scalar implicature, which requires an extra processing step.

slide-58
SLIDE 58

Whence Parsimony?

Tantalizing possibility: We know that computing implicatures from string takes time. So maybe Parsimony preferences reflect a more general parsing principle: we always prefer the parse that takes the least time to

  • compute. Loading up a parse with ‘unsatisified’ (i.e. not yet

computed) implicatures gives it a disadvantage in the ‘race’ to be the interpretation. The horse raced past the barn fell.

slide-59
SLIDE 59

Scalar Adjectives

Pick up the tall glass… SEDIVY ET AL (1999)

slide-60
SLIDE 60

Time Course

Pick up the tall glass… SEDIVY ET AL (1999)