Paper: A Uniform Treatment Of Pragmatic Inferences In Simple And Complex Utterances And Sequences Of Utterances

ACL ID P95-1020
Title A Uniform Treatment Of Pragmatic Inferences In Simple And Complex Utterances And Sequences Of Utterances
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1995
Authors

Drawing appropriate defeasible infe- rences has been proven to be one of the most pervasive puzzles of natu- ral language processing and a recur- rent problem in pragmatics. This pa- per provides a theoretical framework, called stratified logic, that can ac- commodate defeasible pragmatic infe- rences. The framework yields an al- gorithm that computes the conversa- tional, conventional, scalar, clausal, and normal state implicatures; and the presuppositions that are associa- ted with utterances. The algorithm applies equally to simple and complex utterances and sequences of utteran- ces. 1 Pragmatics and Defeasibility It is widely acknowledged that a full account of na- tural language utterances cannot be given in terms of only syntactic or semantic phenomena. For ex- ample, Hirschberg (19...