Research on Improved Algorithm for Chinese Word Segmentation Based on Markov Chain

Pang Baomao, Shi Haoshan
{"title":"Research on Improved Algorithm for Chinese Word Segmentation Based on Markov Chain","authors":"Pang Baomao, Shi Haoshan","doi":"10.1109/IAS.2009.317","DOIUrl":null,"url":null,"abstract":"Chinese words segmentation is an important technique for Chinese web data mining. After the research made on some Chinese word segmentation nowadays, an improved algorithm is proposed in this paper. The algorithm updates dictionary by using Two-way Markov Chain, and does word segmentation by applying an improved Forward Maximum Matching Method based on word frequency statistic. The simulation shows this algorithm can finish word segmentation for a given text quickly and accurately.","PeriodicalId":240354,"journal":{"name":"2009 Fifth International Conference on Information Assurance and Security","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 Fifth International Conference on Information Assurance and Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAS.2009.317","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Chinese words segmentation is an important technique for Chinese web data mining. After the research made on some Chinese word segmentation nowadays, an improved algorithm is proposed in this paper. The algorithm updates dictionary by using Two-way Markov Chain, and does word segmentation by applying an improved Forward Maximum Matching Method based on word frequency statistic. The simulation shows this algorithm can finish word segmentation for a given text quickly and accurately.
基于马尔可夫链的中文分词改进算法研究
中文分词是中文网页数据挖掘的一项重要技术。本文通过对目前一些中文分词算法的研究,提出了一种改进的分词算法。该算法采用双向马尔可夫链更新词典,采用改进的基于词频统计的前向最大匹配方法进行分词。仿真结果表明,该算法可以快速准确地完成给定文本的分词。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信