Unknown Word Recognition Based on Maximal Cliques

Hao Chen, Bo Xiao, Zhiqing Lin
{"title":"Unknown Word Recognition Based on Maximal Cliques","authors":"Hao Chen, Bo Xiao, Zhiqing Lin","doi":"10.1109/CyberC.2011.46","DOIUrl":null,"url":null,"abstract":"Unknown word recognition is a key issue in Chinese information processing. The traditional algorithms of unknown word recognition can be broadly classified into two types: the rule-based methods and the statistical methods. However, these algorithms have some limitations in identifying the unknown words which are created on Internet. The unknown words of Internet have no obvious rules and are composed of common words, so the rule-based methods have limitations in identifying them; while the statistical methods also have limitations in identifying them for they use mutual information. Therefore, this paper proposes an algorithm of unknown word recognition, which is based on the bigram model and uses the method of mining maximal cliques to identify the unknown words of Internet. Experimental results show that the algorithm achieves a higher accuracy than the traditional statistical methods that are based on the N-gram model.","PeriodicalId":227472,"journal":{"name":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","volume":"66 2-3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CyberC.2011.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Unknown word recognition is a key issue in Chinese information processing. The traditional algorithms of unknown word recognition can be broadly classified into two types: the rule-based methods and the statistical methods. However, these algorithms have some limitations in identifying the unknown words which are created on Internet. The unknown words of Internet have no obvious rules and are composed of common words, so the rule-based methods have limitations in identifying them; while the statistical methods also have limitations in identifying them for they use mutual information. Therefore, this paper proposes an algorithm of unknown word recognition, which is based on the bigram model and uses the method of mining maximal cliques to identify the unknown words of Internet. Experimental results show that the algorithm achieves a higher accuracy than the traditional statistical methods that are based on the N-gram model.
基于最大团的未知词识别
未知词识别是中文信息处理中的一个关键问题。传统的未知词识别算法大致可分为两类:基于规则的方法和统计方法。然而,这些算法在识别网络上产生的未知词时存在一定的局限性。网络未知词没有明显的规则,由常用词组成,基于规则的方法在识别网络未知词时存在局限性;而统计方法在识别它们方面也有局限性,因为它们使用的是相互信息。为此,本文提出了一种基于双元图模型的未知词识别算法,利用挖掘最大团的方法对互联网中的未知词进行识别。实验结果表明,该算法比基于N-gram模型的传统统计方法具有更高的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信