{"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}
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.