基于改进片段合并算法的双语文本相似度检测与分析研究

IF 0.5 Q4 ENGINEERING, MULTIDISCIPLINARY
Miao Zhang
{"title":"基于改进片段合并算法的双语文本相似度检测与分析研究","authors":"Miao Zhang","doi":"10.1504/ijcsm.2023.133635","DOIUrl":null,"url":null,"abstract":"To achieve cross language text similarity analysis, an improved fragment merging algorithm based on dynamic programming is proposed. Dynamic programming is introduced into the fragment merging algorithm to improve the merging algorithm, so as to improve the cross language detection, gradually merge fragments from keyword detection, and verify the performance of the algorithm, such as recall, accuracy and detection time, through comparative analysis experiments. The results show that the recall and accuracy of the merging algorithm based on dynamic programming are more than 80% in the performance test. In addition, it can be found that the fragment merging algorithm has faster fragment merging speed and plagiarism detection speed in the comparison of algorithms. The performance of the improved fragment merging algorithm in plagiarism detection has great advantages, but also has great application value, which provides a new solution for the field of text similarity calculation.","PeriodicalId":45487,"journal":{"name":"International Journal of Computing Science and Mathematics","volume":"33 1","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on bilingual text similarity detection and analysis based on improved fragment merging algorithm\",\"authors\":\"Miao Zhang\",\"doi\":\"10.1504/ijcsm.2023.133635\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To achieve cross language text similarity analysis, an improved fragment merging algorithm based on dynamic programming is proposed. Dynamic programming is introduced into the fragment merging algorithm to improve the merging algorithm, so as to improve the cross language detection, gradually merge fragments from keyword detection, and verify the performance of the algorithm, such as recall, accuracy and detection time, through comparative analysis experiments. The results show that the recall and accuracy of the merging algorithm based on dynamic programming are more than 80% in the performance test. In addition, it can be found that the fragment merging algorithm has faster fragment merging speed and plagiarism detection speed in the comparison of algorithms. The performance of the improved fragment merging algorithm in plagiarism detection has great advantages, but also has great application value, which provides a new solution for the field of text similarity calculation.\",\"PeriodicalId\":45487,\"journal\":{\"name\":\"International Journal of Computing Science and Mathematics\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computing Science and Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijcsm.2023.133635\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computing Science and Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijcsm.2023.133635","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0

摘要

为了实现跨语言文本相似度分析,提出了一种改进的基于动态规划的片段合并算法。在片段合并算法中引入动态规划,对合并算法进行改进,从而改进跨语言检测,从关键词检测开始逐步合并片段,并通过对比分析实验验证算法的召回率、准确率、检测时间等性能。结果表明,基于动态规划的合并算法在性能测试中召回率和准确率均在80%以上。此外,在算法的比较中可以发现,片段合并算法具有更快的片段合并速度和抄袭检测速度。改进的片段合并算法在抄袭检测中的性能有很大的优势,同时也有很大的应用价值,为文本相似度计算领域提供了新的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on bilingual text similarity detection and analysis based on improved fragment merging algorithm
To achieve cross language text similarity analysis, an improved fragment merging algorithm based on dynamic programming is proposed. Dynamic programming is introduced into the fragment merging algorithm to improve the merging algorithm, so as to improve the cross language detection, gradually merge fragments from keyword detection, and verify the performance of the algorithm, such as recall, accuracy and detection time, through comparative analysis experiments. The results show that the recall and accuracy of the merging algorithm based on dynamic programming are more than 80% in the performance test. In addition, it can be found that the fragment merging algorithm has faster fragment merging speed and plagiarism detection speed in the comparison of algorithms. The performance of the improved fragment merging algorithm in plagiarism detection has great advantages, but also has great application value, which provides a new solution for the field of text similarity calculation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
1.30
自引率
0.00%
发文量
37
×
引用
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学术官方微信