Computer Science – Computation and Language
Scientific paper
1995-04-26
Computer Science
Computation and Language
7 pages, LaTeX Source. To appear in the Proceedings of ACL-95. Requires aclap.sty file
Scientific paper
Drawing 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.
Hirst Graeme
Marcu Daniel
No associations
LandOfFree
A Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Uniform Treatment of Pragmatic Inferences in Simple and Complex Utterances and Sequences of Utterances will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-334857