汉语亲属关系的语义表示和自动推理  

The semantic representation and automatic reasoning for Chinese kinship relations

作　　者：陈振宇[1] 袁毓林[2] 

机构地区：[1]复旦大学中国语言文学系,上海200433 [2]北京大学中文系/汉语语言学研究中心/计算语言学教育部重点实验室,100871

出　　处：《中国语文》2010年第1期44-56,共13页Studies of the Chinese Language

基　　金：国家社会科学基金项目“面向内容计算的汉语语义角色知识库的研究和建设”(批准号:07AYY004);国家高技术研究发展计划(863计划)项目“基于人类认知的语义知识融合、学习与计算技术”(课题编号:2007AA01Z173);复旦大学文科科研推进计划“金苗”项目“汉语亲属关系自动转换信息处理”(批准号:09JM014)的资助

摘　　要：我们通过对汉语亲属词语的语义特征和语义关系进行分析,用一阶谓词逻辑设计了一个亲属关系的语义表示和自动推理模型。首先选取七种语义特征作为描写和定义所有亲属关系的基础,并把这些语义特征视为谓词,把相关的人物视为变元;然后将特定亲属关系的语义特征用运算符号"或"、"与"联结成逻辑表达式;最后给出一种简洁的亲属关系转换算法,包括四个运算步骤:1)把两个已知亲属关系的逻辑表达式联结在一起;2)使用辅助运算规则把表达式中蕴含的信息全部找出来;3)使用化简运算规则把表达式转化为最简表达式;4)从最简表达式上进行归结从而获得答案。Based on an analysis of the semantic features and relations of Chinese kinship terms,this paper establishes a kinship automatic reasoning model with first-order predicate logic. Seven basic semantic features are chosen as the basis to derive the definitions of all kinship relations. These features function as predicates and the related persons as their variables. The semantic features of a certain kinship can be connected with disjunction and conjunction operators to form logic expressions of the kinship. The paper then offers a succinct algorithm of kinship relation reasoning,including four steps of operation:1) the logic expressions of two known kinship relations are joined together; 2) the laws of assistant operation provide all the information entailed in the logic expression; 3) the laws of simplification operation transform the expression into a simplified one; 4) the answer is given from the simplified expression.

关 键 词：亲属词语 语义特征 亲属关系 自动推理 一阶谓词逻辑 运算规则 运算流程 

分 类 号：H136[语言文字—汉语]