Plagiarism Checker & Link Advisor using concepts of Levenshtein Distance Algorithm with Google Query Search - An Approach

Dhanraj Arvind Nandurkar, Priyanka Ujjainkar, Bhakti Miglani, Ayush Kanojiya
{"title":"Plagiarism Checker & Link Advisor using concepts of Levenshtein Distance Algorithm with Google Query Search - An Approach","authors":"Dhanraj Arvind Nandurkar, Priyanka Ujjainkar, Bhakti Miglani, Ayush Kanojiya","doi":"10.1109/ICAISC56366.2023.10085404","DOIUrl":null,"url":null,"abstract":"In the revolutionary era of research, there has been quite rapid improvement in Research fields with ample amount of publishing of research papers, now-a-days. The developed model focuses on two main approaches, “Levenshtein’s Distance Algorithm” and “Google Query Search” method to combinedly innovate a new aspect for tackling plagiarism issues. To assist precise and authenticate referring links similar to the suspicious plagiarized text in one’s review or research paper. The developed model has achieved a prominent level of accuracy percentage mentioning a few minor assets like, preventing the redirection of referring links to the junk sites.","PeriodicalId":422888,"journal":{"name":"2023 1st International Conference on Advanced Innovations in Smart Cities (ICAISC)","volume":"291 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 1st International Conference on Advanced Innovations in Smart Cities (ICAISC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAISC56366.2023.10085404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the revolutionary era of research, there has been quite rapid improvement in Research fields with ample amount of publishing of research papers, now-a-days. The developed model focuses on two main approaches, “Levenshtein’s Distance Algorithm” and “Google Query Search” method to combinedly innovate a new aspect for tackling plagiarism issues. To assist precise and authenticate referring links similar to the suspicious plagiarized text in one’s review or research paper. The developed model has achieved a prominent level of accuracy percentage mentioning a few minor assets like, preventing the redirection of referring links to the junk sites.
抄袭检查和链接顾问使用Levenshtein距离算法的概念与谷歌查询搜索-一种方法
在研究的革命时代,研究领域的进步相当迅速,研究论文的发表量也非常大。该模型以“Levenshtein距离算法”和“Google查询搜索”两种主要方法为核心,共同创新了解决抄袭问题的新视角。协助精确和验证参考链接类似于可疑的剽窃文本在一个人的评论或研究论文。开发的模型已经达到了一个突出的准确率水平,提到一些小资产,如,防止指向垃圾网站的链接重定向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信