| 基于改进的正向最大匹配中文分词算法研究 |
| |
| 引用本文： | 王惠仙,龙华.基于改进的正向最大匹配中文分词算法研究[J].贵州大学学报(自然科学版),2011,28(5):112-115,119. |
| |
| 作者姓名： | 王惠仙 龙华 |
| |
| 作者单位： | 昆明理工大学信息工程与自动化学院,云南昆明,650051 |
| |
| 摘 要： | 中文自动分词技术在中文信息处理、Web文档挖掘等处理文档类研究中是一项关键技术,而分词算法是其中的核心.正向最大匹配算法FMM( Forward Maximum Match)具有切分速度快、简洁、容易实现等优点,但是还存在分词过程中设定的最大词长初始值固定不变的问题,带来匹配次数相对较多的弊端.针对此问题提出了根据中文...
|
| 关 键 词： | 自动分词 中文信息处理 挖掘 最大匹配 |
The Research of Chinese Word Segmentation Algorithm Based on Forward Maximum Match |
| |
| WANG Hui-xian,LONG Hua.The Research of Chinese Word Segmentation Algorithm Based on Forward Maximum Match[J].Journal of Guizhou University(Natural Science),2011,28(5):112-115,119. |
| |
| Authors: | WANG Hui-xian LONG Hua |
| |
| Institution: | WANG Hui-xian,LONG Hua(Information Engineering and Automation College,Kunming University of Technology,Kunming 650051,PRC) |
| |
| Abstract: | The Chinese automatic word segmentation is always one key component in many fields of Chinese information processing,the Web documents mining and so on..The Chinese word segmentation algorithm is one of the cores.Forward maximum matching(FMM) algorithm is fast,simple,easy to implement,but there is a problem in forward maximum matching(FMM) algorithm that the initial value of the maximum word-length is immovable,this might lead to the longer words can be matched repeatedly.Aiming at this problem,this paper p... |
| |
| Keywords: | automatic word segmentation Chinese information processing mining maximum match |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
