26.01.2013 Views

Presuppositions in Spoken Discourse

Presuppositions in Spoken Discourse

Presuppositions in Spoken Discourse

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Between B<strong>in</strong>d<strong>in</strong>g and Accommodation<br />

With<strong>in</strong> the b<strong>in</strong>d<strong>in</strong>g theory of presuppositions, Bos et al. (1995) present a<br />

resolution procedure for bridg<strong>in</strong>g NPs that uses <strong>in</strong>formation represented <strong>in</strong><br />

Pustejovsky’s (1991) generative lexicon to help resolve examples of bridg<strong>in</strong>g<br />

anaphors. They illustrate the approach with a few simple examples that they work<br />

out <strong>in</strong> detail, such as the bridge between bar – barkeeper. This is an approach that is<br />

highly dependent on the <strong>in</strong>formation coded <strong>in</strong> the generative lexicon, which is a<br />

mixture of encyclopedic and lexical <strong>in</strong>formation.<br />

Piwek & Krahmer (2000) present a lexically based approach that uses a<br />

rework<strong>in</strong>g of the b<strong>in</strong>d<strong>in</strong>g theory <strong>in</strong> Construction Type-Theory (CTT), a deductive<br />

proof system. It <strong>in</strong>corporates an enriched def<strong>in</strong>ition of context, essentially add<strong>in</strong>g<br />

the same type of lexical or encyclopedic <strong>in</strong>formation as the approaches described<br />

above. Piwek & Krahmer’s work is <strong>in</strong>terest<strong>in</strong>g for two reasons.<br />

The first reason is that they make a dist<strong>in</strong>ction between two types of<br />

bridg<strong>in</strong>g <strong>in</strong>ferences. The first type is straightforward lexical ones, such as example<br />

(5). To resolve these, a lexical relationship is <strong>in</strong>tegrated <strong>in</strong> the CTT context to build<br />

a deductive proof that makes the bridg<strong>in</strong>g <strong>in</strong>ference explicit. Examples like (2) are<br />

more complicated and are treated by a procedure that <strong>in</strong>corporates both b<strong>in</strong>d<strong>in</strong>g<br />

and accommodation. Piwek & Krahmer propose treat<strong>in</strong>g the presupposition of the<br />

chandelier as decomposable <strong>in</strong>to two parts, the <strong>in</strong>formation that the presupposed<br />

object is a light, and the <strong>in</strong>formation that the light is more specifically a chandelier.<br />

The <strong>in</strong>formation that the object is a light can be bound to the room on the basis of<br />

world knowledge that rooms have lights, and <strong>in</strong>tegrated <strong>in</strong>to the CTT context. The<br />

second part of the presupposition, e.g. that the light is a chandelier, needs to be<br />

accommodated. 5 Piwek and Krahmer argue that some type of reason<strong>in</strong>g<br />

mechanism will be necessary even when bridg<strong>in</strong>g relationships can be analyzed <strong>in</strong><br />

terms of lexical relationships like the first type <strong>in</strong> order to calculate the <strong>in</strong>ference.<br />

They also po<strong>in</strong>t out that not all bridg<strong>in</strong>g references can be analyzed with lexical<br />

<strong>in</strong>formation.<br />

The second reason why Piwek & Krahmer’s work is <strong>in</strong>terest<strong>in</strong>g is that they<br />

acknowledge the problem that there may be more than one potential way to <strong>in</strong>fer a<br />

relationship between the anchor and the bridg<strong>in</strong>g NP, and they suggest two<br />

conditions that can help make the bridg<strong>in</strong>g process determ<strong>in</strong>ate, as Clark (1975)<br />

argued it should be. An effort condition, based on the stopp<strong>in</strong>g rule presented <strong>in</strong><br />

Clark (1975), encourages the shortest, consistent bridg<strong>in</strong>g <strong>in</strong>ference def<strong>in</strong><strong>in</strong>g it<br />

operationally by the complexity of the proof <strong>in</strong> CTT. In addition, a plausibility<br />

condition helps disambiguate examples when there is more than one potential<br />

anchor and one resolution would be more plausible or consistent with the speaker’s<br />

<strong>in</strong>tentions. In effect, this mechanism is <strong>in</strong>tended to take care of examples where the<br />

lexical approach is faced with an ambiguity <strong>in</strong> choice of anchors, the same type of<br />

examples that make up the majority of the data that has led to the development of<br />

5 Note that this is all done with<strong>in</strong> the CTT approach <strong>in</strong> such a way that the descriptive content<br />

that the light is a chandelier is accommodated by add<strong>in</strong>g a new variable to the proof.<br />

159

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!