Penerapan Algoritma Knuth-Morris-Pratt dalam Mendeteksi Tingkat Kemiripan Judul Skripsi Berbasis Web

Abstract

In terms of finding the problem topic for thesis titles, students often have difficulty in determining thesis titles, in addition, there may be similarities between students. Manually checking the title requires more effort, for it takes a system to detect the level of similarity in the thesis title. To design and build a thesis title-level detection system using the Knuth-Morris-Pratt algorithm. To find out the percentage of similarities in the title, the Knuth-Morris-Pratt algorithm at the time of matching the string is Enter query of the word to be searched, matching the word arrangement pattern used as an example at the beginning of the text. From left to right, this algorithm will match character per character pattern with characters in the corresponding text, the algorithm then shifts the wording pattern until the word arrangement pattern used as an example is at the end of the text. Based on the analysis, design and implementation of the similarity level detection system of two or more thesis titles using the Knuth Morris Pratt algorithm it can be concluded that: The detection system has been successfully created using the Knuth Morris Pratt algorithm (KMP). It has been obtained the results of analysis by the process of string matching between strings with patterns where the system postulates the results of analysis in the form of the number of word similarities and percentages

Pengembangan Engine Web Crawler Sebagai Pencari Jejak Serangan Cyber Stored Cross-Site Scripting

“…Algoritma Knuth-Morris-Pratt (KMP) merupakan suatu algoritma pencarian string untuk mencari teks berdasarkan urutan dari kiri ke kanan yang dikembangkan oleh D. E. Knuth, J. H. Morris dan V. R. Pratt [11]. Algoritma KMP bekerja dengan cara mencocokkan pattern atau susunan kata yang dicari dari kiri ke kanan pada awal teks, lalu menggeser susunan kata sampai susunan kata tersebut berada di ujung teks.…”

Penerapan Algoritma Pencarian Knuth-Morris-Pratt dalam Sistem Informasi Perpustakaan pada SMAN 1 Babelan

“…Algoritma ini melakukan pencocokan terhadap string dari karakter per-karakter yang melakukan pencarian pada pattern dan teks (Khairan & Ahmadian, 2019;Sadiah, 2017). Dengan algoritma Knuth-Morris-Pratt dalam perpustakaan membuat penelusuran sistem lebih cepat pelayanan perpustakaan dapat berjalan lancar (Nursobah & Pahrudin, 2019) Cara kerja Algoritma Knuth-Morris-Pratt (KMP) menurut pada saat mencocokan string menurut (Islamiyati & Fikri, 2022)…”