处理照应关系的范畴类型逻辑

On Treating the Anaphora of Categorical Type Logic

范畴类型逻辑把自然语言的毗连组合归结成运算和推演,而运算和推演所依赖的毗连组合则遵循"邻近原则"逐层逐级进行。话语表现理论擅长刻画的自然语言语句中代词和名词的照应关系,在范畴类型逻辑那里很难通过邻近毗连组合的运算推演体现出来。近年来,西方学者Jager尝试增添范畴类型逻辑的推演工具去描述自然语言的照应关系,取得了一定成果。但为恰当说明句子序列中的照应关系,还需对Jager的方案做一点增补。

In categorical type logic, the concatenation of natural language is viewed as the process of computation and deduction, which, based on the principle of adjacency, is implemented hierarchically. However, the anaphora between noun and pronoun in natural language, which is best elaborated in Discourse Representation Theory, is hardly represented in the computation and deduction characterized by adjacent concatenation. For this reason, Jager：a Western scholar, has made an attempt to add new tools in categorical type logic to represent the anaphora of natural language in recent years. This writer of the paper, however, will make some supplements to parts of his scheme.