Pendeteksian Plagiarisme Skripsi Menggunakan Algoritma Levenshtein Distance Berbasis Web


  • Ckristian Hutagalung STMIK Budi Darma
Keywords: Plagiarism Detection, Thesis, Levenshtein Distance

Abstract

Plagiarism is a violation that often occurs and deserves attention. Because the act of plagiarism is the act of plagiarizing other people's work and acknowledging it as a personal work. Therefore, the detection of plagiarism needs to be done to reduce plagiarism of the work of others. This study aims to detect the similarity of the title of the thesis text using the Levenshtein Distance algorithm so that it can be used to help determine plagiarism. The stages in the system are preprocessing which consists of case folding, tokenizing, filtering, stemming, sorting. After the preprocessing process, the next step is to calculate using the Levenshtein Distance method by measuring the similarity value so that it gets a similarity percentage value between the two titles. In this thesis, the author uses the Levenshtein Distance method is a string matrix used to measure the difference or distance between two strings

Downloads

Download data is not yet available.

Author Biography

Ckristian Hutagalung, STMIK Budi Darma

Plagiarism is a violation that often occurs and deserves attention. Because the act of plagiarism is the act of plagiarizing other people's work and acknowledging it as a personal work. Therefore, the detection of plagiarism needs to be done to reduce plagiarism of the work of others. This study aims to detect the similarity of the title of the thesis text using the Levenshtein Distance algorithm so that it can be used to help determine plagiarism. The stages in the system are preprocessing which consists of case folding, tokenizing, filtering, stemming, sorting. After the preprocessing process, the next step is to calculate using the Levenshtein Distance method by measuring the similarity value so that it gets a similarity percentage value between the two titles. In this thesis, the author uses the Levenshtein Distance method is a string matrix used to measure the difference or distance between two strings.

References

Na’firul Hasna Ariyani, Sutardi, Rahmat Ramadhan, Aplikasi pendeteksian kemiripan teks dokumen menggunakan metode levenshtein distance. semanTIK : 2016.

Herlina, http://www.e-jurnal.com/2013/10/pengertian-skripsi.html, e-jurnal : 2006.

Peggy, Seng Hansun, Optimasi Pencarian Kata pada Aplikasi Penerjemah Bahasa Mandarin-Indonesia Berbasis Android dengan algorima Levenshtein Distance, ISSN: 2355-3286, 2015

B.P.Pratama, S.A.Pamungkas, Analisis Kinerja Algoritma Levenshtein Distance dalam Mendeteksi Kemiripan Dokumen Teks, ISSN:1978-8586, 2016

Religia, Yoga; Www.Academia.edu, (2009)

Andika, Dwiky; Www.It-jurnal.com, (2016)

Kusnadi, Enkus; Www.mypctutorel.co.id, (2013)

Andre, Www.duniailkom.com, (2014)

Anisya ; Aplikasi Sistem Database Rumah Sakit Terpusat Pada Rumah Sakit Umum AISYIYAH Padang; 1693-752X (2013)


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Pendeteksian Plagiarisme Skripsi Menggunakan Algoritma Levenshtein Distance Berbasis Web

Published
2019-09-29