Penerapan Algoritma Levenshtein Distance pada Aplikasi Asisten Guru Bahasa Inggris
DOI:
https://doi.org/10.29407/inotek.v3i1.530Abstract
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.
Keywords:
Text similarity, plagiarism, Levenshtein Distance##plugins.themes.default.displayStats.downloads##
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.
Downloads
Published
Issue
Section
License
Copyright (c) 2020 M. Fahrur Azhri, Daniel Swanjaya, Ratih Kumalasari Niswatin

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Copyright on any article is retained by the author(s).
- The author grants the journal, right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgment of the work’s authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal’s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.
- The article and any associated published material is distributed under the Creative Commons Attribution-ShareAlike 4.0 International License