在同态加密数据上使用语音和排版字母分组编辑距离加权修改

T. Ahmad, Kukuh Indrayana, W. Wibisono, R. Ijtihadie
{"title":"在同态加密数据上使用语音和排版字母分组编辑距离加权修改","authors":"T. Ahmad, Kukuh Indrayana, W. Wibisono, R. Ijtihadie","doi":"10.1109/ICSITECH.2017.8257147","DOIUrl":null,"url":null,"abstract":"Edit Distance string matching algorithm gives same weight for every single mismatching character. In fact, mismatching can be caused by phonetic error, mistyping error, or unknown error. An improvement has been made by Editex which modifies that algorithm. However, it tolerates only the phonetic error. In this paper, we increase its performance by proposing new weighting and distance calculation of that algorithm. Here, the source of mismatching is grouped into phonetic and typographic errors. Characters are divided into groups of phoneticity and typography, which have their own weight. By using this letter grouping, our proposed method is also suitable for implementation in homomorphic encrypted data. Experimental results show that this method produces lower false positive rates than the Edit Distance and Editex algorithms. The proposed method generates 2.2 false positives per experiment, while Edit Distance and Editex produce 8.24 and 3.12, respectively. It can be inferred that this proposed method is able to produce a relatively low error rate.","PeriodicalId":165045,"journal":{"name":"2017 3rd International Conference on Science in Information Technology (ICSITech)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Edit distance weighting modification using phonetic and typographic letter grouping over homomorphic encrypted data\",\"authors\":\"T. Ahmad, Kukuh Indrayana, W. Wibisono, R. Ijtihadie\",\"doi\":\"10.1109/ICSITECH.2017.8257147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Edit Distance string matching algorithm gives same weight for every single mismatching character. In fact, mismatching can be caused by phonetic error, mistyping error, or unknown error. An improvement has been made by Editex which modifies that algorithm. However, it tolerates only the phonetic error. In this paper, we increase its performance by proposing new weighting and distance calculation of that algorithm. Here, the source of mismatching is grouped into phonetic and typographic errors. Characters are divided into groups of phoneticity and typography, which have their own weight. By using this letter grouping, our proposed method is also suitable for implementation in homomorphic encrypted data. Experimental results show that this method produces lower false positive rates than the Edit Distance and Editex algorithms. The proposed method generates 2.2 false positives per experiment, while Edit Distance and Editex produce 8.24 and 3.12, respectively. It can be inferred that this proposed method is able to produce a relatively low error rate.\",\"PeriodicalId\":165045,\"journal\":{\"name\":\"2017 3rd International Conference on Science in Information Technology (ICSITech)\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 3rd International Conference on Science in Information Technology (ICSITech)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSITECH.2017.8257147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 3rd International Conference on Science in Information Technology (ICSITech)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSITECH.2017.8257147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

编辑距离字符串匹配算法对每一个不匹配的字符给予相同的权重。实际上,不匹配可能是由语音错误、打字错误或未知错误引起的。Editex对该算法进行了改进。然而,它只允许语音错误。在本文中,我们通过提出新的权重和距离计算来提高该算法的性能。在这里,不匹配的来源分为语音和排版错误。汉字被分为语音组和排版组,它们有自己的权重。通过使用这种字母分组,我们提出的方法也适用于在同态加密数据中实现。实验结果表明,该方法比Edit Distance和Editex算法产生更低的误报率。该方法每次实验产生2.2个假阳性,而Edit Distance和Editex分别产生8.24个和3.12个假阳性。可以推断,该方法能够产生较低的错误率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Edit distance weighting modification using phonetic and typographic letter grouping over homomorphic encrypted data
Edit Distance string matching algorithm gives same weight for every single mismatching character. In fact, mismatching can be caused by phonetic error, mistyping error, or unknown error. An improvement has been made by Editex which modifies that algorithm. However, it tolerates only the phonetic error. In this paper, we increase its performance by proposing new weighting and distance calculation of that algorithm. Here, the source of mismatching is grouped into phonetic and typographic errors. Characters are divided into groups of phoneticity and typography, which have their own weight. By using this letter grouping, our proposed method is also suitable for implementation in homomorphic encrypted data. Experimental results show that this method produces lower false positive rates than the Edit Distance and Editex algorithms. The proposed method generates 2.2 false positives per experiment, while Edit Distance and Editex produce 8.24 and 3.12, respectively. It can be inferred that this proposed method is able to produce a relatively low error rate.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信