摘要
通过对汉语查询句的研究,建立了复合概念、逻辑概念与标准概念的内在联系.通过分析各种查询条件,得出查询条件表达式可以形式化表示为二叉树的结论,在此基础上,构造了查询条件字符块转换为二叉树的一套算法.
Through the study of the Chinese query statement, the internal relationship of compound conceptions ,logical conceptions and standard conceptions is formed and studied. By analyzing all kinds of query conditions of the Chinese query statements, an important conclusion that query conditions expressions can be expressed as the binary tree is drawn. A set of algorithms changing character block of the query condition into the binary tree is constructed.
出处
《郑州大学学报（理学版）》
CAS
2005年第3期54-57,共4页
Journal of Zhengzhou University:Natural Science Edition
基金
河南省科技厅科技攻关项目
编号0424220146
关键词
汉语自然语言
计算机处理
人机接口
查询条件
数据库查询
Chinese natural language
computer processing
man-machine interface
query conditons
database query
作者简介
赵剑威（1963-），男，讲师，主要从事自然语言理解和软件工程研究；E-mail：zhjw@hadoe.edu.cn。
