首页> 外文学位 >A formalism and an algorithm for computing pragmatic inferences and detecting infelicities
【24h】

A formalism and an algorithm for computing pragmatic inferences and detecting infelicities

机译:一种形式主义和一种算法,用于计算务实的推理和检测不恰当之处

获取原文
获取原文并翻译 | 示例

摘要

Since Austin introduced the term infelicity, the linguistic literature has been flooded with its use. However, no formal or computational explanation has been given for infelicity. This thesis provides one for those infelicities that occur when a pragmatic inference is cancelled.;We exploit a well-known difference between pragmatic and semantic information: since implicatures and presuppositions are not specifically uttered, pragmatic inferences are defeasible, while most of semantic inferences are indefeasible. Our contribution assumes the existence of a finer grained taxonomy with respect to pragmatic inferences. It is shown that if one wants to account for the natural language expressiveness, one should distinguish between pragmatic inferences that are felicitous to defeat and pragmatic inference that are infelicitously defeasible. Thus, it is shown that one should consider at least three types of information: indefeasible, felicitously defeasible, and infelicitously defeasible. The cancellation of the last of these determines the pragmatic infelicities.;A new formalism has been devised to accommodate the three levels of information, called stratified logic. Within it, we are able to express formally notions such as utterance u presupposes p or utterance u is infelicitous. The formalism yields an algorithm for computing interpretations for utterances, for determining their associated presuppositions, and for signalling infelicities. Its implementation is a Lisp program that takes as input a set of stratified formulas that constitute the necessary semantic and pragmatic knowledge and the logical translation of an utterance or set of utterances and that computes a set of optimistic interpretations of the given utterances. The program computes for each set of utterances the associated presuppositions and signals when an infelicitous sentence has been uttered. (Abstract shortened by UMI.).
机译:自奥斯丁引入“不熟”一词以来,语言文献已被大量使用。但是,没有给出正式的或计算上的解释。本文为那些取消语用推理时出现的模棱两可提供了一个依据。;我们利用了语用信息和语义信息之间的一个众所周知的区别:由于没有明确地表达暗示和预设,所以语用推理是不可行的,而大多数语义推理是不可行的。不可思议的。我们的贡献假设在实用推理方面存在更细粒度的分类法。事实表明,如果要说明自然语言的表现力,就应该区分那些容易失败的实用推论和一种难以实现的实用推论。因此,表明人们应该考虑至少三种类型的信息:不可行,不可行和不可行。这些中的最后一个的取消决定了务实的盲目行为。一种新的形式主义已被设计来容纳信息的三个层次,称为分层逻辑。在其中,我们能够表达正式的概念,例如话语u假设p或话语u不恰当。形式主义产生了一种算法,用于计算话语的解释,确定其相关的预设以及发信号通知轻率。它的实现是一个Lisp程序,它将一组分层公式作为输入,这些分层公式构成了必要的语义和语用知识以及一种或多种发音的逻辑翻译,并计算出对给定发音的一组乐观解释。该程序为每组话语计算相关的预设,并在说出不雅句子时发出信号。 (摘要由UMI缩短。)。

著录项

  • 作者

    Marcu, Constantin Daniel.;

  • 作者单位

    University of Toronto (Canada).;

  • 授予单位 University of Toronto (Canada).;
  • 学科 Computer science.;Linguistics.
  • 学位 M.Sc.
  • 年度 1994
  • 页码 139 p.
  • 总页数 139
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号