检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:姚从军 李奕丹 YAO Congjun;LUO Dan(Biquan Academy,Xiangtan University,Xiangtan 411105,China)
出 处:《周口师范学院学报》2019年第1期1-6,共6页Journal of Zhoukou Normal University
基 金:湖南省社科基金一般项目"面向汉语信息处理的CCG词库研究"(17YBA397)
摘 要:从经典命题逻辑到原始兰贝克演算,基于规则的存废形成了演算的"结构层级"。对于自然语言的计算处理来说,各层级系统各有优劣。虽然原始兰贝克演算较好地体现了自然语言的资源管理方式,但它是一种非结合非交换的系统,故在计算处理上存在许多不足之处。依据交换规则和结合规则的不同取舍,形成了四个层级的兰贝克演算系统。不同兰贝克演算系统具有不同语料描述模式,故处理语言现象的专长有别。系统LLC(或LLCW′)使原始兰贝克演算增加了后承前件中资源可重复使用的能力,混合范畴类型逻辑使原始兰贝克演算增加了受控的结合能力或交换能力,二者合并之结果应是自然语言计算处理的理想工具。The"hierarchical structure"from classical propositional logic to original lambek calculus is formed by the presence or absence of structure rules.For the calculation and processing of natural language,each level system has advantages and disadvantages.Original lambek calculus embodies a resource management regime that we generally find in natural language,but it is non-associative and non-permutation,so there are still many deficiencies in the calculation process.There are four versions of Lambek calculus in terms of Association and Permutation rules.Different versions of Lambek calculus have different representing modes for natural language,thus they have different expertise in dealing with language.LLC(or LLCW′)enables the original lambeck calculus to increase the ability of resources to be reused in the antecedent parts,and hybrid categorial type logics enables the original lambeck calculus to increase the ability of controlled?associativity and permutation,so the combination of them should be an ideal tool for natural language computing process.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.3