基于中文陈述句灵活语序的Lambek演算

Lambek Calculus of Flexible Word Order of Chinese Based Statements

目前,自然语言处理已从句法、词法层面走向轻量级语义层面。针对中文陈述句的自然语言处理,传统Lambek演算无法解决中文陈述句灵活语序的问题,而现有的方法加入模态词、新连接词等后,又进一步增加了已经是NP-hard的Lambek演算的复杂性,因此并不适合计算机的相关处理。基于此,采用加标动词匹配的Lambek演算对中文陈述句灵活语序进行处理。加标动词匹配算法的时间复杂度低,使得计算机及其程序能有效地对中文陈述句灵活语序进行处理,并能通过Curry-Howard对应理论与λ-演算引入轻量级语义处理。

Now natural language processing has shifted from syntactic/lexical level to lightweight semantic level. As for the natural language processing of Chinese narrative sentences, the traditional Lamhek calculus cannot solve the problem of processing those Chinese statements with a flexible word order. And the present methods, such as adding modal words or new conjunctions,are not suitable for the relevant computer processing, because they will increase the complexity of the NP-hard Lambek calculus. In response, this paper used the Lambek calculus of marked verb matching to process the flexible word order of narrative sentences in Chinese. A low time complexity of the marked verb matching algorithm enables the computer programs to effectively process the flexible-word-ordered Chinese sentences, and also makes it possible to apply the lightweight semantic processing according to the corresponding Curry-Howard theory as well as lambda-calculus.