Autocorrect on Drugs e-Dictionary Search Module Using Levenshtein Distance Algorithm

Autocorrect pada Modul Pencarian Drugs e-Dictionary Menggunakan Algoritma Levenshtein Distance

  • Halimah Tus Sadiah Universitas Pakuan
  • Muhamad Saad Nurul Ishlah Universitas Pakuan
  • Nisa Najwa Rokhmah Universitas Pakuan
Keywords: autocorrect, drugs e-dictionary, algorithm, the Levenshtein Distance algorithm.


The Dictionary of Medicine in the form of a physical book has many drawbacks, one of them is its thickness makes it impractical to be carried. This becomes a motivation to develop drug dictionary applications in the form of a Drugs e-Dictionary. One of the developed Drugs e-Dictionary uses A-Z index-based approach to discover any drug terms. This approach is less effective and less efficient timewise. Therefore, it is necessary to add a search function that has an autocorrect feature to aid the user. The purpose of this study is to build a search module that has an autocorrect feature on Drugs e-Dictionary using the Levenshtein Distance algorithm. The methodology or the stages of this research divided into the construction of a search module on Drugs e-Dictionary, implementation of the Levenshtein Distance algorithm, and autocorrect validation test. The results of the algorithm implementation show that the search module with the autocorrect feature can detect typing errors in the inputted terms by producing the closest drug term output in the database, then automatically provide suggestions for improvement and display the results of the improved drug terms to the user. it reaches 90% accuracy of inputted query, with 90% precision and 90% recall. 


Download data is not yet available.


GNPOPA. 2015. Materi Edukasi Tentang Peduli Obat dan Pangan Aman. Jakarta: GNPOPA.

Nuryati. 2017. Farmakologi. Jakarta: Kementrian Kesehatan republik Indonesia.

Lalwani, M., Bagmar, N., & Parikh, S. 2014. Efficient Algorithm for Auto Correction Using ngram Indexing. International Journal of Computer & Communication Technology (IJCCT). 3(3), pp. 23-27.

Afriansyah, Z., Puspitaningrum , D., & Ernawati. 2015. Rancang Bangun Aplikasi Pencocokan Dna Manusia Menggunakan Algoritma Levenshtein Distance (Studi Kasus: Dna Kanker Hati Manusia). Jurnal Rekursif . 3(2), pp. 61-67.

Pratama, B., & Pamungkas, S. 2016. Analisis Kinerja Algoritma Levenshtein Distance Dalam Mendeteksi Kemiripan Dokumen Teks. Jurnal Log!k@ . 6(2), pp. 131-143.

Aprilianto, T., & Badawi , A. 2017. Sistem Koreksi Kata Dan Pengenalan Struktur Kalimat Berbahasa Indonesia Dengan Pendekatan Kamus Berbasis Levenshtein Distance. Jurnal SPIRIT. 9 (1), pp. 48-61.

Rosmala D, Risyad ZF. 2017. Algoritma Levenshtein Distance Dalam Aplikasi Pencarian Kata Isu Di Kota Bandung Pada Twitter. MIND Journal. 2(2), pp.1-12.

Adriyani, N. M., Santiyasa, I. W., & Muliantara, A. (n.d.). Implementasi Algoritma Levenshtein Distance Dan Metode Empiris Untuk Menampilkan Saran Perbaikan Kesalahan Pengetikan Dokumen Berbahasa Indonesia. [Cited 2018 August 1]. Available from

Mishra, R., & Kaur, N. 2013. A Survey of Spelling Error Detection and Correction Techniques. International Journal of Computer Trends and Technology . 3 (4), pp. 372-374.

Ariyani, N., Sutardi, & Ramadhan, R. 2016. Aplikasi Pendeteksi Kemiripan Isi Teks Dokumen Menggunakan Metode Levenshtein Distance. semanTIK. 2(1), pp. 279-286.

Haldar, R., & Mukhopadhyay, D.2011. Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach. [Cited 2018 August 1]. Available from

Ngafidin, K. N., & Wibawanto, H. 2015. Implementasi Fitur Autocomplete dan Algoritma Levenshtein Distance untuk Meningkatkan Efektivitas Pencarian Kata di Kamus Bes arBahasa Indonesia (KBBI). Jurnal Teknik Elektro. 7(1), pp.1-6.

Pressman R dan Maxim B.R. 2014. Software Engineering a Practitioners approach. McGraw-Hill Education : New York.

Satzinger, J., Jackson , R., & Burd , S. 2010. System Analysis and Design in a changing World. USA: Course Technology Cengage Learning.

IAI (Ikatan Apoteker Indonesia). 2019. ISO Informasi Spesialite Obat Indonesia Vol 52-Tahun 2019. Jakarta : Isfi Penerbitan.

A.Pahdi. Koreksi Ejaan Istilah Komputer Berbasis Kombinasi Algoritma Damerau-Levenshtein dan Algoritma Soundex. Journal Speed – Sentra Penelitian Engineering dan Edukasi.8:2, pp. 1-8. 2016.

P.A.Arsaningtyas, M.A. Bijaksana. S.A. Faraby. Sistem Pencarian Ayat Al-Quran Berdasarkan KemiripanUcapan Menggunakan Algoritma Soundex dan Damerau-Levenshtein Distance. Jurnal Linguistik Komputasional. 1:2, pp. 58-64. 2018

How to Cite
Tus Sadiah, H., Muhamad Saad Nurul Ishlah, & Nisa Najwa Rokhmah. (2020). Autocorrect on Drugs e-Dictionary Search Module Using Levenshtein Distance Algorithm. Jurnal RESTI (Rekayasa Sistem Dan Teknologi Informasi), 4(1), 64 - 69.
Artikel Rekayasa Sistem Informasi