Analisis dan Deteksi Kemiripan Teks Berbasis Python dengan Algoritma Levenshtein Distance

Improvements in information technology have complicated the issue of plagiarism in academia, particularly in higher education. This project intends to create a plagiarism detection tool that examines the similarity of PDF files to established references utilizing the Levenshtein Distance method. The suggested system can effectively and precisely identify plagiarism by a series of procedures, such as text extraction, linguistic Preprocessing (tokenisation and stopword removal), and calculating the degree of similarity using the Levenshtein Distance method. Testing was carried out on various scenarios, including variations in document size and plagiarism levels. The experimental results show that the higher the level of similarity between the document and the reference, the longer the computing time required. However, this system can detect plagiarism with a fairly good success rate, even in documents with a low level of similarity. Black box testing confirms that this application can work according to the expected specifications, namely inputting PDF documents, detecting plagiarism, and providing accurate similarity percentage results. This research contributes to providing a plagiarism detection tool that can help maintain academic integrity, with the possibility of further development through integration with machine learning and user interface improvements.

Authors

Publication Details

Journal
Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika)
Published
2025-02-28
DOI
https://doi.org/10.30645/jurasik.v10i1.869
Primary Topic
Computer Science and Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Analisis dan Deteksi Kemiripan Teks Berbasis Python dengan Algoritma Levenshtein Distance

Haris Sudarman, Y Yulhendri
Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika)
Computer Science and Engineering
article

Analisis dan Deteksi Kemiripan Teks Berbasis Python dengan Algoritma Levenshtein Distance

Haris Sudarman, Y Yulhendri
article en

Abstract

Improvements in information technology have complicated the issue of plagiarism in academia, particularly in higher education. This project intends to create a plagiarism detection tool that examines the similarity of PDF files to established references utilizing the Levenshtein Distance method. The suggested system can effectively and precisely identify plagiarism by a series of procedures, such as text extraction, linguistic Preprocessing (tokenisation and stopword removal), and calculating the degree of similarity using the Levenshtein Distance method. Testing was carried out on various scenarios, including variations in document size and plagiarism levels. The experimental results show that the higher the level of similarity between the document and the reference, the longer the computing time required. However, this system can detect plagiarism with a fairly good success rate, even in documents with a low level of similarity. Black box testing confirms that this application can work according to the expected specifications, namely inputting PDF documents, detecting plagiarism, and providing accurate similarity percentage results. This research contributes to providing a plagiarism detection tool that can help maintain academic integrity, with the possibility of further development through integration with machine learning and user interface improvements.

Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika)Vol. 10(1)
Openalex Percentile: Top 97%
Computer Science and Engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Analisis dan Deteksi Kemiripan Teks Berbasis Python dengan Algoritma Levenshtein Distance — Haris Sudarman, Y Yulhendri · Jurasik (Jurnal Riset Sistem Informasi dan Teknik Informatika) (2025) | TGRS Research Map | TGRS