| 基于双字词的动态最大匹配分词算法的研究 |
| |
| 引用本文： | 宋国柱,;陈俊杰. 基于双字词的动态最大匹配分词算法的研究[J]. 太原重型机械学院学报, 2009, 0(3): 199-202 |
| |
| 作者姓名： | 宋国柱, 陈俊杰 |
| |
| 作者单位： | [1]山西农业大学现代教育技术学院,山西太谷030801; [2]太原理工大学计算机与软件学院,太原030024 |
| |
| 摘 要： | 通过研究和分析现有最大匹配分词算法，词库结构的设计和分词算法直接关系着分词的速度和效率，提出了一种改进的最大匹配分词算法——基于双字词的动态最大匹配分词算法，设计并实现了汉语分词词库和算法。实验结果表明，此算法相对于现有最大匹配分词算法有显著提高。
|
| 关 键 词： | 中文分词 动态 最大匹配 词库 |
Realization of Dynamic Maximum Matching Arithmetic |
| |
| Affiliation: | SONG Guo-zhu, CHEN Jun-jie(1. Modem Educational and Technological College of Shanxi Agricultural University,Shanxi Taigu 030801, China; 2. Computer and Software College of Taiyuan University of Technology, Taiyuan 030024, China) |
| |
| Abstract: | By researching and analyzing current Maximum Matching arithmetic, it can be concluded that the design of thesaurus and Chinese words segmentation arithmetic directly affects the speed and efficiency of words. An improved Maximum Matching Chinese words segmentation arithmetic, called Dynamic Maximum Matching arithmetic,is put forward, in which Chinese-word thesaurus and arithmetic are designed and realized. The result of experience shows that this kind of arithmetic is remarkably improved compared with current Maximum .Matching arithmetic. |
| |
| Keywords: | Chinese words segmentation dynamic maximum matching thesaurus |
| 本文献已被 维普 等数据库收录！ |
|
