Penerapan Algoritma Levenshtein Distance pada Aplikasi Asisten Guru Bahasa Inggris
PDF

Keywords

Text similarity
plagiarism
Levenshtein Distance

How to Cite

Azhri, M. F. ., Swanjaya, D. ., & Niswatin, R. K. . (2021). Penerapan Algoritma Levenshtein Distance pada Aplikasi Asisten Guru Bahasa Inggris. Prosiding SEMNAS INOTEK (Seminar Nasional Inovasi Teknologi), 3(1), 155–160. Retrieved from https://proceeding.unpkediri.ac.id/index.php/inotek/article/view/530

Abstract

Many plagiarism acts among high school students when submitting assignments and lacking systems which are able to detect similarities in the contents of students’ tasks. In a nutshell, the teacher finds it difficult to get the authenticity of the tasks done by students. This study aims at creating an English teacher assistant application, to make it easier to correct the authenticity of students’ essay assignments so that the teacher can get the task that is the original work of the students themselves without any act of plagiarism. This application is divided into two stages, namely the stages of the text preprocessing and then the similarity calculation is done with the Levenshtein Distance algorithm. Stages of text preprocessing consist of tokenizing, purifying, stopword removal, stemming, and sorting. To get text similarity scores between students, calculations are made with the Levenshtein Distance algorithm by applying the limit of the text similarity value (threshold) to 70%, if the students’ text similarity is less than 70%, the document will be received by the system and entered into the database. Text similarity exceeds 70%, then the document will be rejected. Therefore, the results of this study can help English teachers, especially educational institutions, to obtain original documents and reduce plagiarism from an early age at the high school level.

PDF

References

Irianto, WA. 2014. Penentuan Tingkat Plagiarisme Dokumen PenelitianMenggunakan Centroid Linkage Hierarchical Method (CLHM).Jurnal Program Teknologi Informasi dan Ilmu Komputer, UniversitasBrawijaya.Malang.

Pratama, B. P. & Pamungkas, S. A. 2016. Analisis Kinerja Algoritma Levenshtein Distance dalam Mendeteksi Kemiripan Dokumen Teks. Jurnal Logika, Jilid 6, No. 2, 2016, Hal. 131-143I.

Zhan Su, Byung-Ryul Ahn, Ki-yol Eom, Min-koo Kang, Jin-Pyung Kim, dan MoonKyun Kim. 2008. Plagiarism Detection Using the Levenshtein Distance and SmithWaterman Algorithm. The 3rd Intetnational Conference on Innovative Computing Informaion and Control, Department of Artificial Intelligence, University ofSungkyunkwan, Cheoncheon dong, Jangan-gu, Suwon, Korea.

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Copyright (c) 2020 M. Fahrur Azhri, Daniel Swanjaya, Ratih Kumalasari Niswatin

Downloads

Download data is not yet available.