摘要
提出了基于关键词搜索的两种自动分词算法。均以双词及三词作为搜索的最小单位 (或基本单位 )。一种以栈实现 ,一种不借助栈且动态匹配实现。通过此两种算法均可进行发布网站、网页前网名入数据库的关键词标识提取及实现匹配后有效性的确认 。
Two autopartition algorithms based on keyword searching are given in this article,in which two words or three words are used as the minimum unit (or basic unit) in searching,one is implemented by use of stack,and the other is not but by the way of dynamic matching.Both algorithms can extract the keyword identification from a network name entering the database before broadcast net nod,front page,and confirm the validity after matching so as to improve the high accuracy of Chinese character search enging and achieve quick response determined by synchronism before and after network name entering the database.
出处
《电脑开发与应用》
2002年第6期26-27,共2页
Computer Development & Applications
关键词
中文搜索引肇
自动分词算法
中文信息处理
Chinese character search enging,autopartition,stack,nonstack,keyword search
