计算机科学 ›› 2014, Vol. 41 ›› Issue (10): 270-275.doi: 10.11896/j.issn.1002-137X.2014.10.057

• 人工智能 • 上一篇    下一篇

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

刘冬宁,邓春国,滕少华,梁路   

  1. 广东工业大学计算机学院 广州510006;广东工业大学计算机学院 广州510006;广东工业大学计算机学院 广州510006;广东工业大学计算机学院 广州510006
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金项目(61272067,61104156,61370229),国家科技支撑计划课题(2013BAH72B01)资助

Lambek Calculus of Flexible Word Order of Chinese Based Statements

LIU Dong-ning,DENG Chun-guo,TENG Shao-hua and LIANG Lu   

  • Online:2018-11-14 Published:2018-11-14

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

关键词: Lambek演算,中文陈述句,灵活语序,动词匹配

Abstract: 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 Lambek 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.

Key words: Lambek calculus,Chinese statements,Flexible word order,Match of verb

[1] Atkinson J,Matamala J.Evolutionary Shallow Natural Lan-guage Parsing[J].Computational Intelligence,2012,28(2):156-175
[2] Elias H.The Big Data Challenge:How to Develop a Winning Strategy[J].中国制造业信息化,2012,47(14):53-55
[3] Lambek J.The Mathematics of Sentence Structure[J].The A-merican Mathematical Monthly,1958,3(65):153-169
[4] Kozak M.Cyclic Involutive Distributive Full Lambek Calculus is Decidable[J].Journal of Logic and Computation,2011,21(2):231-252
[5] 郝身刚,张丽.轻量级语义Web服务发现模型的研究[J].计算机工程与设计,2011,32(2):450-456
[6] Surarso B,Ono H.Cut elimination in noncommutative substructurallogics[J].Reports on Mathematical Logic,1996,0:13-29
[7] Buszkowski W,Lin Zhe.Pregroup Grammars with Letter Promotions[J].Language and Automata Theory and Applications,2010,6031:130-141
[8] 邹崇理.多模态范畴逻辑研究[J].哲学研究,2006(9):115-121
[9] 刘冬宁,汤庸,滕少华,等.基于时态数据库的极小子结构逻辑系统[J].计算机学报,2013(8):1592-1561
[10] Bernardi,Moortgat.Continuation semantics for the Lambek-Grishin calculus[J].Information & Computation,2010,208(5):397-416
[11] 刘冬宁,汤庸,黄昌勤,等.基于时态查询语言的并发Lambek演算及范畴语法[J].智能系统学报,2009(6):245-250
[12] Bitter C,Elizondo D A,Yang Ying-jie.Natural language processing:a prolog perspective[J].Artificial Intelligence Review,2010,33(1/2):151-173
[13] Lin Zhe.Modal Nonassociative Lambek Calculus with Assumptions:Complexity and Context-Freeness[J].Language and Automata Theory and Applications,2010,6031:414-425
[14] Buszkowski W,Lin Zhe,Moroz K.Pregroup Grammars withLetter Promotions:Complexity and context-freeness[J].Journal of Computer and System Science,2012,7351,78(6):1899-1909
[15] Jger G.Anaphora and Type Logical Grammar[M].UiL OTS Working Paper,September 2001:7-110
[16] Lin Zhe.Distributive Full Nonassociative Lambek Calculus with S4-Modalities Is Context-Free[J].Logical Aspects of Computational Linguistic,2012:161-172

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!