Halimah Tus Sadiah, Muhamad Saad Nurul Ishlah, Nisa Najwa Rokhmah

Judul	:	Querry Suggestion on drugs edictionary using levenshtein distance algorithm
Abstrak	:	Dictionary of medicine in the form of a thick book has many disadvantages, one of which is impractical. This is the reason for Indonesian developers to create drugs e-Dictionary. But the drugs e-Dictionary that has been developed is still in the form of a letter index so that users must search the terms one by one in sequential order. This has become so inefficient and ineffective that it is necessary to add a search function and query suggestion feature to the drug e-dictionary. The purpose of this study is to build a query suggestion facility on drugs e-Dictionary using the Levenshtein Distance algorithm. The stages of this research consist of the Development of web-based drugs e-Dictionary, Implementation of the Levenshtein Distance Algorithm, Query Suggestion Testing, and Usage. The query suggestion function works by producing the closest word output contained in the database. Based on the results of the implementation of the Levenshtein Distance algorithm and test results, Drugs e-Dictionary can evaluate words that are not in the database. It reaches 90% accuracy of inputted query, with 90% precision and 90% recall in confusion matrix.
Tahun	:	2019	Media Publikasi	:	Jurnal Nasional Terakreditasi B
Kategori	:	Jurnal	No/Vol/Tahun	:	3 / 10 / 2019
ISSN/ISBN	:	2088-1541
PTN/S	:	Universitas Pakuan	Program Studi	:	MANAJEMEN INFORMATIKA (D3)
Bibliography	:	[1]      Departemen Kesehatan RI. Tanggung Jawab Apoteker Terhadap Keselamatan Pasien (Patient Safety ). Jakarta: Direktorat Bina Farmasi Komunitas Dan Klinik Ditjen Bina Kefarmasian Dan Alat Kesehatan Departemen Kesehatan RI. 2008. [2]      Y. Song, & Li-wei He. 2010. Optimal Rare Query Suggestion With Implicit User. ACM Journals.pp: 901-910. [3]      S. Jiang, S. Zilles, & R. Holte. 2008. Query suggestion by query search: a new approach to user support in web search [Online]. [Cited 2018 August 1]. Available from www.cs.uregina.ca/~zilles/jiangZH09.pdf [4]      Y. Song, D. Zhou., & L.W. He. 2011. Post-ranking-query-suggestion-by-diversifying-searchresul [Online]. [Cited 2018 August 1]. Available from https://www.microsoft.com/id-id/: https://www.microsoft.com/en-us/research/publication/post-ranking-query-suggestionbydiversifying-search-results/ [5]      J.-M.Yangy, R. Cai, F. Jingz, S.Wangy, L. Zhangy, & W.Y.Ma. 2008. Search-based Query Suggestion.[Online] [Cited 2018 August 1]. Available from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.159.3499&rep=rep1&type=pdf [6]      Q. Mei, D. Zhou & K Church 2008. Query Suggestion Using Hitting Time [Online]. [Cited 2018 August 1]. Available from https://www.microsoft.com/enus/ research/wpcontent/uploads/2017/01/sugg.pdf [7]      H. Cao, D. Jiang,J. Pei, Q. He, Z. Liao, E. Chen, & H. Li. 2008. Context-Aware Query Suggestion by Mining Click-Through [Online]. [Cited 2018 August 1]. Available from https://www.cs.sfu.ca/~jpei/publications/QuerySuggestion-KDD08.pdf [8]      Z.-J. Zha, L. Yang, T. Me., M. Wang, & Zengfu. Visual Query Suggestion. ACM Journals. pp. 15-24. 2009. [9]      S. Bathia, D. Majumdar, & P. Mitra. Query Suggestions in the Absence of Query Logs. ACM Journals, pp. 1-10.2011. [10]    Z.Afriansyah, D.Puspitaningrum, & Ernawati. Rancang Bangun Aplikasi Pencocokan DNA Manusia Menggunakan Algoritma Levenshtein Distance (Studi Kasus: Dna Kanker Hati Manusia). Jurnal Rekursif . 3:2,pp. 61-67.2015. [11]    B. Pratama & S. Pamungkas, Analisis Kinerja Algoritma Levenshtein Distance Dalam Mendeteksi Kemiripan Dokumen Teks. Jurnal Log!k@ . 6:2, pp. 131-143.2016 [12]    T. Aprilianto, & A. Badawi. Sistem Koreksi Kata Dan Pengenalan Struktur Kalimat Berbahasa Indonesia Dengan Pendekatan Kamus Berbasis Levenshtein Distance. Jurnal SPIRIT. 9:1, pp 48-61. 2017. [13]    R. Haldar, & D. Mukhopadhyay. 2011. Levenshtein Distance Technique in Dictionary Lookup Methods: An Improved Approach [Online]. [Cited 2018 August 1]. Available from [14]    R. Mishra, & N. Kaur. A Survey of Spelling Error Detection and Correction Techniques. International Journal of Computer Trends and Technology.  3:4, pp. 372-374. 2013 [15]    N. Ariyani, N., R. Sutardi, & Ramadhan. Aplikasi Pendeteksi Kemiripan Isi Teks Dokumen Menggunakan Metode Levenshtein Distance. semanTIK. 2:1,pp. 279-286. 2016. [16]    K.N. Ngafidin & H. Wibawanto. Implementasi Fitur Autocomplete dan Algoritma Levenshtein Distance untuk Meningkatkan Efektivitas Pencarian Kata di Kamus Besar Bahasa Indonesia (KBBI). Jurnal Teknik Elektro. 7:1, pp.1-6. 2015 [17]    R Pressman dan B.R. Maxim. Software Engineering a Practitioners approach. McGraw-Hill Education : New York. 2014. [18]    J Satzinger, R. Jackson, & S. Burd. System Analysis and Design in a changing World. USA: Course Technology Cengage Learning. 2010. [19]    Ikatan Apoteker Indonesia. ISO Informasi Spesialite Obat Indonesia Vol 52-Tahun 2019. Jakarta : Isfi Penerbitan.2019 [20]  M. Navin, Pankaja R. Performance Analysis of Text Classification Algorithms using Confusion Matrix. International Journal of Engineering and Technical Research (IJETR). 6:2,pp. 75-78. 2016 [21]    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. [22]       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
URL	: