{"title":"Winnowing vs Extended-Winnowing: A Comparative Analysis of Plagiarism Detection Algorithms","authors":"Shiva Shrestha, Sushan Shakya, Sandeep Gautam","doi":"10.36548/jtcsst.2023.3.001","DOIUrl":null,"url":null,"abstract":"Plagiarism is the main problem in the digital world, as people use others’ content without giving prior credit to the creator. Therefore, there should be proper and efficient algorithms to find plagiarized content on the Internet. This research proposes two algorithms: the winnowing algorithm and the extended winnowing algorithm. The winnowing algorithm can only calculate the similarity rate between documents, whereas the extended algorithm can mark the plagiarized text segment in the compared records along with their similarity rates. The similarity rate in both algorithms has been calculated using the Jaccard Coefficient. Although the extended algorithm is beneficial as it provides a text marking feature, it consumes more computation power, which is discussed in this study. There are research works done previously using this approach, but none has compared the algorithms’ performance on small texts. Thus, this research utilizes the Twitter form of data to test these algorithms’ performance, as it contains a maximum of 280 characters. The application proposed to detect plagiarism in tweets has been developed using Python as the backend and React as the front-end technology.","PeriodicalId":107574,"journal":{"name":"Journal of Trends in Computer Science and Smart Technology","volume":"47 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Trends in Computer Science and Smart Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.36548/jtcsst.2023.3.001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Plagiarism is the main problem in the digital world, as people use others’ content without giving prior credit to the creator. Therefore, there should be proper and efficient algorithms to find plagiarized content on the Internet. This research proposes two algorithms: the winnowing algorithm and the extended winnowing algorithm. The winnowing algorithm can only calculate the similarity rate between documents, whereas the extended algorithm can mark the plagiarized text segment in the compared records along with their similarity rates. The similarity rate in both algorithms has been calculated using the Jaccard Coefficient. Although the extended algorithm is beneficial as it provides a text marking feature, it consumes more computation power, which is discussed in this study. There are research works done previously using this approach, but none has compared the algorithms’ performance on small texts. Thus, this research utilizes the Twitter form of data to test these algorithms’ performance, as it contains a maximum of 280 characters. The application proposed to detect plagiarism in tweets has been developed using Python as the backend and React as the front-end technology.