摘要
提出了一种快速Web分词算法,该算法采用首字哈希存储和词条等长分簇存储的思想,采用近邻匹配和二分查找相结合的查找算法,可以方便实现邻近匹配,提高了效率。
This paper proposes a fast Web participle algorithm. This algorithm uses thought of a first character Haxi memory and long minute bunch of memory of vocabulary entry. Using a search algorithm that combines the close neighbor match with two minutes searches may realize neighbor match and enhance the efficiency.
出处
《航空计算技术》
2007年第6期68-69,共2页
Aeronautical Computing Technique
基金
西安市教育局科研基金资助项目(JKY2005358043)
关键词
Web分词
中文分词
分簇存储
近邻匹配
Web participle
chinese participle
minute bunch of memory
chose neighbor match
