| 基于N-最短路径的中文分词技术研究 |
| |
| 引用本文： | 吴晓倩,胡学钢.基于N-最短路径的中文分词技术研究[J].淮南工业学院学报,2014(1):72-75. |
| |
| 作者姓名： | 吴晓倩 胡学钢 |
| |
| 作者单位： | [1]合肥工业大学计算机与信息学院,安徽合肥230009 [2]安徽医学高等专科学校公共卫生与卫生管理系,安徽合肥230061 |
| |
| 摘 要： | 中文分词技术是中文信息处理的基础，快速、准确的中文分词方法是进行中文信息搜索的关键。基于N-最短路径的分词算法，需要计算有向图中从起点到终点的所有路径值，分词效率低，将动态删除算法与最短路径算法结合，通过从最短路径中删除部分节点的策略减少搜索路径范围，从而提高分词效率。
|
| 关 键 词： | 信息处理 中文分词 N-最短路径 删除算法 |
Research on Chinese Word Segmentation Based on N -shortest Path |
| |
| WU Xiao-qian,HU Xue-gang.Research on Chinese Word Segmentation Based on N -shortest Path[J].Journal of Huainan Institute of Technology(Natural Science),2014(1):72-75. |
| |
| Authors: | WU Xiao-qian HU Xue-gang |
| |
| Affiliation: | 1. School of Computer and Information Technology, Hefei University of Technology, Hefei Anhui 230009, China;2. School of Public Health and Health Management, Anhui Medical College, Hefei Anhui 230061, China) |
| |
| Abstract: | Chinese word segmentation is the basis of information processing , rapid and accurate Chinese word segmentation method is the key for information search .Segmentation algorithm based on N -shortest paths , need to calculate the directed graph from the starting point of all the path to the end , the word segmentation effi-ciency is low , the dynamic deletion algorithm combined with the algorithm of the shortest path , by removing part of the node from the shortest path strategy to reduce the search path , so as to improve the efficiency of segmenta-tion. |
| |
| Keywords: | information processing Chinese word segmentation N-shortest path deletion algorithm |
| 本文献已被 维普 等数据库收录！ |
|
