IDEAS home Printed from https://ideas.repec.org/a/gvu/tcsst0/v5y2023i3id2041.html

Winnowing vs Extended-Winnowing: A Comparative Analysis of Plagiarism Detection Algorithms

Author

Listed:
  • Shiva Shrestha
  • Sushan Shakya
  • Sandeep Gautam

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.

Suggested Citation

Handle: RePEc:gvu:tcsst0:v:5:y:2023:i:3:id:2041
DOI: 10.36548/jtcsst.2023.3.001
as

Download full text from publisher

File URL: https://irojournals.com/tcsst/article/view/2041
File Function: Abstract page
Download Restriction: no

File URL: https://irojournals.com/tcsst/article/download/2041/1859
File Function: Full text
Download Restriction: no

File URL: https://libkey.io/10.36548/jtcsst.2023.3.001?utm_source=ideas
LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
---><---

More about this item

Keywords

;
;
;
;
;
;

Statistics

Access and download statistics

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:tcsst0:v:5:y:2023:i:3:id:2041. See general information about how to correct material in RePEc.

If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

We have no bibliographic references for this item. You can help adding them by using this form .

If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .

Please note that corrections may take a couple of weeks to filter through the various RePEc services.

IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.