Codability and Robustness in Formal Natural Language Semantics
Codability and Robustness in Formal Natural Language Semantics
复制标题
形式自然语言语义中的可编码性和鲁棒性
DOI：
--
复制
发表时间：
2014
期刊：
影响因子：
--
通讯作者：
Kristina Liefke
中科院分区：
文献类型：
--
作者：
Kristina Liefke
根据蒙太古提出并为其后继者所采用的公认的类型逻辑语义学观点，正确预测词汇复合句之间的蕴涵关系需要许多不同类型的语义对象。本文认为不需要这种丰富的语义本体。特别是，它表明，parte的温度难题——它的解决通常被认为需要指标或单个概念的基本类型——可以在[11]的更简洁的类型系统中解决，[11]只假设基本的个体和命题。我们推广了这一结果，证明了ptq片段在[11]模型类中的合理性。我们的发现支持类型理论模型的鲁棒性，而不是对象的编码。
According to the received view of type-logical semantics (suggested by Montague and adopted by many of his successors), the correct prediction of entailment relations between lexically complex sentences requires many different types of semantic objects. This paper argues against the need for such a rich semantic ontology. In particular, it shows that Partee’s temperature puzzle – whose solution is commonly taken to require a basic type for indices or for individual concepts – can be solved in the more parsimonious type system from [11], which only assumes basic individuals and propositions. We generalize this result to show the soundness of the PTQ-fragment in the class of models from [11]. Our findings support the robustness of type-theoretic models w.r.t. their objects’ codings.