{"_id":{"_str":"534282740e946d920a001afe"},"__v":7,"authorIDs":["5456f4cc8b01c819300000ad","545761622abc8e9f3700033e"],"author_short":["Marcu, D.","Hirst, G."],"bibbaseid":"marcu-hirst-auniformtreatmentofpragmaticinferencesinsimpleandcomplexutterancesandsequencesofutterances-1995","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Daniel"],"propositions":[],"lastnames":["Marcu"],"suffixes":[]},{"firstnames":["Graeme"],"propositions":[],"lastnames":["Hirst"],"suffixes":[]}],"title":"A uniform treatment of pragmatic inferences in simple and complex utterances and sequences of utterances","booktitle":"Proceedings, 33rd Annual Meeting, Association for Computational Linguistics","address":"Cambridge, MA","month":"June","year":"1995","pages":"144–150","abstract":"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.","download":"http://ftp.cs.toronto.edu/pub/gh/Marcu+Hirst-acl-95.ps","bibtex":"@InProceedings{\t marcu16,\n author\t= {Daniel Marcu and Graeme Hirst},\n title\t\t= {A uniform treatment of pragmatic inferences in simple and\n\t\t complex utterances and sequences of utterances},\n booktitle\t= {Proceedings, 33rd Annual Meeting, Association for\n\t\t Computational Linguistics},\n address\t= {Cambridge, MA},\n month\t\t= {June},\n year\t\t= {1995},\n pages\t\t= {144--150},\n abstract\t= {Drawing appropriate defeasible inferences has been proven\n\t\t to be one of the most pervasive puzzles of natural language\n\t\t processing and a recurrent problem in pragmatics. This\n\t\t paper provides a theoretical framework, called stratified\n\t\t logic, that can accommodate defeasible pragmatic\n\t\t inferences. The framework yields an algorithm that computes\n\t\t the conversational, conventional, scalar, clausal, and\n\t\t normal state implicatures; and the presuppositions that are\n\t\t associated with utterances. The algorithm applies equally\n\t\t to simple and complex utterances and sequences of\n\t\t utterances.},\n download\t= {http://ftp.cs.toronto.edu/pub/gh/Marcu+Hirst-acl-95.ps}\n}\n\n","author_short":["Marcu, D.","Hirst, G."],"key":"marcu16","id":"marcu16","bibbaseid":"marcu-hirst-auniformtreatmentofpragmaticinferencesinsimpleandcomplexutterancesandsequencesofutterances-1995","role":"author","urls":{},"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"www.cs.toronto.edu/~fritz/tmp/compling.bib","downloads":0,"keywords":[],"search_terms":["uniform","treatment","pragmatic","inferences","simple","complex","utterances","sequences","utterances","marcu","hirst"],"title":"A uniform treatment of pragmatic inferences in simple and complex utterances and sequences of utterances","year":1995,"dataSources":["n8jB5BJxaeSmH6mtR","6b6A9kbkw4CsEGnRX"]}