Search Optimization of PIP Scholarship Recipients In Web-Based Student Data Application Using The Levenshtein Distance Algorithm





keyword correction, levenshtein distance, rup, scholarship, pip


Realizing that education is very important, the government supports every citizen to get education. One of the government programs is the Smart Indonesia Program. PlP is a scholarship designed to help school-age children from poor/vulnerable families to continue to receive education services, both through formal elementary to high school/vocational schools and non-formal pathways from package a to package c and special education. SDN II Babakanloa has not been touched by technology for processing student data. So that the student section has difficulties in recording and updating student data. Student names have unique identities and errors often occur in typing the keywords to be searched. This results in an information that is desired or sought can not be found. Therefore we need a web-based data application that can provide keyword corrections in searching for student names. This study aims to create a web-based student data application by optimizing corrections to typing keywords searched by implementing the Levenshtein Distance Algorithm and also making it easier to process and search student data. The development method used is the Rational Unified Process (RUP) with the stages of Inception, Elaboration, Construction, and Transition. Designed using the CodeIgniter Framework with the PHP and JavaScript programming languages. The application of the Levenshtein Distance Algorithm can optimize the search for student data and reduce the occurrence of search errors by School Operators. The application of the Levenshtein Distance Algorithm produces a very good accuracy rate of 94% of the results of student data correction. accordance with the expectations of the School Operator. So it shows that the application of the Levenshtein Distance Algorithm is appropriate to use in optimizing the search.

GS Cited Analysis


Download data is not yet available.

References (2019). aplikasi web. Amazon.Com.

Arsyad, A. K., Pramono, B., Isnawaty, Yamin, M., & Ihsan. (2019). Implementasi Levenshtein Distance Pada Aplikasi Pencarian Barang Di Berbagai E-Marketplace Menggunakan Teknik Web Scraping. Seminar Nasional APTIKOM (SEMNASTIK) 2019, 1(1), 512–519.

Azhri, M. F., Swanjaya, D., & Niswatin, R. K. (2019). Penerapan Algoritma Levenshtein Distance pada Aplikasi Asisten Guru Bahasa Inggris. Seminar Nasional Inovasi Teknologi, 155–160. (2021). system mangemet school. Camudigitalcampus.Com. (2018). framework. Hostinger.Co.Id.


kemendikbud. (n.d.). No Title. Kemendikbud. Retrieved August 2, 2023, from

Noor Kamala Sari, N., Handrianus Pranatawijaya, V., Bagus Adidyana Anugrah Putra, P., & Studi Teknik Informatika Universitas Palangka Raya Kampus Unpar Tunjung Nyaho Jl Yos Sudarso Palangka Raya, P. (2019). Penerapan Algoritma Levenshtein distance Untuk Pencarian Pada Sistem Informasi Perpustakaan Fakultas Kedokteran Universitas Palangka Raya. Jurnal Saintekom, 9(1), 66–82.

Octaria, O., Ermatita, E., & Sukemi, S. (2019). Penerapan Knowledge Management System Menggunankan Algoritma Levenshtein. Jurnal RESTI (Rekayasa Sistem Dan Teknologi Informasi), 3(2), 233–242. (n.d.). php. Php.Net.

Smart Draw. (n.d.). UML Diagram - Everything You Need to Know About UML Diagrams.

Sukamto, R. A., & Shalahuddin, M. (2019). Rekaya Perangkat Lunak Terstruktur


Crossmark Updates

How to Cite

Agustin, Y. H. ., Yosep Septiana, & Arbi Yuan Aspahany. (2023). Search Optimization of PIP Scholarship Recipients In Web-Based Student Data Application Using The Levenshtein Distance Algorithm. Sinkron : Jurnal Dan Penelitian Teknik Informatika, 8(4), 2069-2081.