A Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances

Simple item page
dc.creatorMarcu, Daniel
dc.creatorHirst, Graeme
dc.date1995-04-26
dc.date.accessioned2026-07-07T09:09:46Z
dc.date.available2026-07-07T09:09:46Z
dc.descriptionDrawing appropriate defeasible inferences has been proven to be one of the most pervasive puzzles of natural language processing and a recurrent problem in pragmatics. This paper provides a theoretical framework, called ``stratified logic'', that can accommodate defeasible pragmatic inferences. The framework yields an algorithm that computes the conversational, conventional, scalar, clausal, and normal state implicatures; and the presuppositions that are associated with utterances. The algorithm applies equally to simple and complex utterances and sequences of utterances.
dc.description7 pages, LaTeX Source. To appear in the Proceedings of ACL-95. Requires aclap.sty file
dc.identifierhttps://arxiv.org/abs/cmp-lg/9504017
dc.identifierhttp://arxiv.org/abs/cmp-lg/9504017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/151154
dc.subjectComputation and Language
dc.titleA Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances
dc.typetext

Files

Collections

arXiv