{"title":"一种改进的基于分词词典的汉语分词算法","authors":"Yan Niu, Lala Li","doi":"10.1109/ICCTD.2009.125","DOIUrl":null,"url":null,"abstract":"Based on the analysis of the traditional forward maximum matching word segmentation algorithm and the characteristics of the principle on the basis of the results of the use of word frequency statistics, we design a new structure of the dictionary, a dictionary based on the new structure to improve the matching algorithm are the largest. After time complexity analysis and experiments, the improved forward maximum matching algorithm can further improve the efficiency of segmentation.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"An Improved Chinese Segmentation Algorithm Based on Segmentation Dictionary\",\"authors\":\"Yan Niu, Lala Li\",\"doi\":\"10.1109/ICCTD.2009.125\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Based on the analysis of the traditional forward maximum matching word segmentation algorithm and the characteristics of the principle on the basis of the results of the use of word frequency statistics, we design a new structure of the dictionary, a dictionary based on the new structure to improve the matching algorithm are the largest. After time complexity analysis and experiments, the improved forward maximum matching algorithm can further improve the efficiency of segmentation.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.125\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.125","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An Improved Chinese Segmentation Algorithm Based on Segmentation Dictionary
Based on the analysis of the traditional forward maximum matching word segmentation algorithm and the characteristics of the principle on the basis of the results of the use of word frequency statistics, we design a new structure of the dictionary, a dictionary based on the new structure to improve the matching algorithm are the largest. After time complexity analysis and experiments, the improved forward maximum matching algorithm can further improve the efficiency of segmentation.