Validasi Pencarian Kata Kunci Menggunakan Algoritma Levenshtein Distance Berdasarkan Metode Approximate String Matching
Keywords:
KBBI Digital, levenshtein distance, approximatte string matching, pencarian,Abstract
Untuk mengatasi kesalahan dalam pencarian kata kunci perlu dilakukan optimasi proses pencarian pada aplikasi Kamus Besar Bahasa Indonesia (KBBI) digital. Namun, tidak sedikit ditemui kesalahan dalam menuliskan kata kunci sehingga menghasilkan keluaran yang tidak sesuai dengan keinginan pengguna. Dalam hal ini diperlukan sistem yang dapat melakukan koreksi hasil pencarian kata kunci pada aplikasi KBBI digital dalam bentuk validasi hasil pencarian. Penelitian ini menggunakan metode Approximate String Matching pada algoritma Levenshtein Distance. Pada metode ini, akan diketahui jarak Levenshtein yang menjadi nilai kemiripan suatu objek bertipe string. Untuk mendapatkan nilai kemiripan dilakukan dengan menghitung jarak antar dua string dengan menghitung jumlah operasi yang terjadi seperti penambahan, penghapusan atau pengurangan karakter. Semakin rendah nilai jarak antar dua string maka semakin tinggi tingkat kemiripan kedua string tersebut dan sebaliknya. Seperti pada tingkat kemiripan antara string “varitas” dengan string “varietas” memiliki tingkat kemiripan dengan melihat Levenshtein Distance sama dengan 1 karena hanya mengalami operasi 1 kali yaitu operasi penambahan karakter dan nilai akurasi similaritas sama dengan 88 %.
References
Y. Rochmawati and R. Kusumaningrum, “Studi Perbandingan
Algoritma Pencarian String dalam Metode Approximate String
Matching untuk Identifikasi Kesalahan Pengetikan Teks,” vol. 7, pp.125–134, 2016.
M. O. Braddley and M. Fachrurrozi, “Koreksi Ejaan Kata Berbahasa Indonesia Menggunakan Algoritma Levensthein Distance,” vol. 3, no. 1, pp. 167–171, 2017.
I. Bagus and K. Surya, “Implementasi Algoritma Levenshtein Pada Sistem Pencarian Judul Skripsi / Tugas Akhir,” vol. 11, pp. 46–53, 2017.
M. Rubio, A. Alba, M. Mendez, and E. Arce-santana, “2013
Iberoamerican Conference on Electronics Engineering and Computer Science A Consensus Algorithm for Approximate String Matching,” J. Mater. Process. Tech., vol. 7, pp. 322–327, 2013.
R. B. Aplikasi, Z. Afriansyah, and D. Puspitaningrum, “Menggunakan Algoritma Levenshtein Distance ( Studi Kasus : DNA Kanker Hati Manusia ),” vol. 3, no. 2, pp. 61–67, 2015.
A. S. Dewi Rokhmah Pyriana , Suprapto, “Program Aplikasi Editor Kata Bahasa Indonesia Menggunakan Metode Approximate String Matching Dengan Algoritma Levenshtein Distance Berbasis Java,” pp. 1–10, 2012.
M. Ben, “Adaptating the levenshtein distance to contextual spelling correction,” vol. 12, no. 1, pp. 127–133, 2015.
J. Informatika, F. Matematika, and P. Alam, “Menggunakan Levenshtein Distance Pada Layout Qwerty,” no. Selisik, pp. 171–176, 2016.
B. P. Pratama, “Analisis Kinerja Algoritma Levenshtein Distance,” no. 2, pp. 131–143, 2016.
Downloads
Published
Issue
Section
License
Copyright Transfer StatementThe copyright to this article is transferred to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) if and when the article is accepted for publication. The undersigned hereby transfers any and all rights in and to the paper including without limitation all copyrights to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) . The undersigned hereby represents and warrants that the paper is original and that he/she is the author of the paper, except for material that is clearly identified as to its original source, with permission notices from the copyright owners where required. The undersigned represents that he/she has the power and authority to make and execute this assignment.
We declare that:
- This paper has not been published in the same form elsewhere.
- It will not be submitted anywhere else for publication prior to acceptance/rejection by this Journal.
Furthermore, I/We hereby transfer the unlimited rights of publication of the above-mentioned paper in whole to Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) . The copyright transfer covers the exclusive right to reproduce and distribute the article, including reprints, translations, photographic reproductions, microform, electronic form (offline, online) or any other reproductions of similar nature.
The corresponding author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. This agreement is to be signed by at least one of the authors who have obtained the assent of the co-author(s) where applicable. After submission of this agreement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted.
Retained Rights/Terms and Conditions
- Authors retain all proprietary rights in any process, procedure, or article of manufacture described in the Work.
- Authors may reproduce or authorize others to reproduce the Work or derivative works for the author’s personal use or for company use, provided that the source and the JIM copyright notice are indicated, the copies are not used in any way that implies Seminar Nasional Ilmu Komputer Dan Teknologi Informasi (SAKTI) endorsement of a product or service of any employer, and the copies themselves are not offered for sale.
- Although authors are permitted to re-use all or portions of the Work in other works, this does not include granting third-party requests for reprinting, republishing, or other types of re-use.
JIM by http://e-journals.unmul.ac.id/index.php/SAKTI/index is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
