Implementation of the Levenshtein Distance Algorithm and the Regular Search Expression Method for Detecting Typors in Javascript

Mu’alif Lihawa; Anggit Dwi Hartanto; Norhikmah Norhikmah; Donni Prabowo; Ika Nur Fajri; Wiwi Widayani

doi:10.32520/stmsi.v12i2.2795

Implementation of the Levenshtein Distance Algorithm and the Regular Search Expression Method for Detecting Typors in Javascript

Mu’alif Lihawa, Anggit Dwi Hartanto, Norhikmah Norhikmah, Donni Prabowo, Ika Nur Fajri, Wiwi Widayani

Abstract

Typing is an activity to write an article in printed form that has been assembled by a typewriter. With the rapid development of the times, typewriters were replaced by computers because they were efficient in making writing or text. a text or writing that is easy to understand in conveying information does not have word mistakes that result in unclear information being conveyed. In word processing applications such as Microsoft Office Word, it has the word suggestions and autocorrect word features which are very useful in checking an article where there are word errors in the writing. This research develops a javascript library to detect typo errors for writing wrong words and recommends the right words to change the wrong words. This study uses the Levenshtein Distance Algorithm and the Regular Search Expression method. The results of this study were successfully applied to the word recommendation feature in the library with an accuracy value of 50% and a precision level of 5%.

Full Text:

PDF

References

F. Adline, T. Tobing, and R. Nainggolan, “Analisis Perbandingan Penggunaan Metode Binary Search Dengan Regular Search Expression,” METHOMIKA: Jurnal Manajemen Informatika & Komputerisasi Akuntansi, vol. 4, no. 2, pp. 168–172, 2020, doi: 10.46880/jmika.Vol4No2.pp168-172.

Yogi, I. Ruslianto, and S. Bahri, “Analisa Log Web Server Untuk Mengetahui Pola Perilaku Pengunjung Website Menggunakan Teknik Regular Expressions,” Coding: Jurnal Komputer dan Aplikasi, vol. 07, no. 01, pp. 120–130, 2019, [Online]. Available: https://httpd.apache.org/docs/2.4/logs.HTM

N. R. Dyah, P. Astuti, F. Noviyanto, and D. Soyusiawati, “Forensik Digital Metode Regex (Regular Expression) Dari Grab Google Search Api Dalam Proses Pelacakan Terhadap Kejahatan Online,” InfoTekjar, vol. 3, no. 1, pp. 90–94, 2018.

Nurul Fadhillah, Huzain Aziz, and Dirgahayu Lantara, “Validasi Pencarian Kata Kunci Menggunakan Algoritma Levenshtein Distance Berdasarkan Metode Approximate String Matching,” Prosiding Seminar Nasional Ilmu Komputer dan Teknologi Informasi, vol. 3, no. 2, pp. 129–133, 2018.

Y. Sari, H. Khatimi, and R. Awlia Fajrin, “Deteksi Plagiarisme menggunakan Algoritma Levenshtein Distance,” JTIULM, vol. 6, no. 1, pp. 31–38, 2021.

R. Adawiyah and N. E. Saragih, “Implementasi Algoritma Levenshtein Distance Dalam Mendeteksi Plagiarisme,” Journal Computer Science and Information Technology(JCoInT) Program Studi Teknologi Informasi, vol. 2, no. 2, pp. 54–63, 2022.

M. F. Azhri, D. Swanjaya, and R. K. Niswatin, “Penerapan Algoritma Levenshtein Distance pada Aplikasi Asisten Guru Bahasa Inggris,” in Seminar Nasional Inovasi Teknologi, 2019, pp. 155–160.

Y. Purnama Sari, G. Aditra Pradnyana, and I. Made Agus Wirawa, “Pengembangan Aplikasi Kamus Bahasa Bima-Bahasa Indonesia Menggunakan Algoritma Levenshtein Distance Sebagai Spell Checker Berbasis Android,” Kumpulan Artikel Mahasiswa Pendidikan Teknik Informatika (KARMAPATI), vol. 5, no. 2, pp. 86–95, 2001.

E. Apriliansi, A. Lestari, and A. S. Sahay, “Implementasi Algoritma Levenshtein Distance Untuk Pencarian Judul Skripsi Dan Menambahkan Fitur Autocomplete Pada Website Repository Skripsi Jurusan Teknik Informatika Universitas Palangka Raya,” JOINTECOMS (Journal of Information Technology and Computer Science) p-ISSN: 2798-284X, vol. 1, no. 2, pp. 2798–3862, 2021, doi: 10.47111.

N. Noor Kamala Sari, V. Handrianus Pranatawijaya, P. Bagus Adidyana Anugrah Putra, and P. Studi Teknik Informatika Universitas Palangka Raya Kampus Unpar Tunjung Nyaho Jl Yos Sudarso Palangka Raya, “Penerapan Algoritma Levenshtein distance Untuk Pencarian Pada Sistem Informasi Perpustakaan Fakultas Kedokteran Universitas Palangka Raya,” JURNAL SAINTEKOM, vol. 9, no. 1, pp. 66–82, 2019.

A. I. Fahma, I. Cholissodin, and R. Setya Perdana, “Identifikasi Kesalahan Penulisan Kata (Typographical Error) pada Dokumen Berbahasa Indonesia Menggunakan Metode N-gram dan Levenshtein Distance,” Jurnal Pengembangan Teknologi Informasi dan Ilmu Komputer, vol. 2, no. 1, pp. 53–62, 2017, [Online]. Available: https://www.researchgate.net/publication/323365722

A. Najib, K. B. Utomo, J. T. Informasi, and P. N. Samarinda, “Deteksi Similaritas Dokumen Abstrak Tugas Akhir Menggunakan Metode Levenshtein Distance,” JUST TI, vol. 10, no. 1, pp. 58–62, 2018.

S. Mariko, “Aplikasi Website Berbasis Html Dan Javascript Untuk Menyelesaikan Fungsi Integral Pada Mata Kuliah Kalkulus,” Jurnal Inovasi Teknologi Pendidikan, vol. 6, no. 1, pp. 80–91, 2019, doi: 10.21831/jitp.v6.1.22280.

https://dongengceritarakyat.com/, “Dongeng Cerita Rakyat, “Cerita Malin Kundang Singkat – Dongeng Legenda Sumatera Barat,” https://dongengceritarakyat.com/cerita-malin-kundang-singkat-don geng-legenda/, 2017. Accessed: Jan. 18, 2023. [Online]. Available: https://dongengceritarakyat.com/cerita-malin-kundang-singkat-don geng-legenda/

D. Rosmala and Z. M. Risyad, “Algoritma Levenshtein Distance dalam Aplikasi Pencarian Kata Isu di Kota Bandung pada Twitter,” MIND Journal | ISSN, vol. ISSN, no. 2, pp. 1–12, 2017, doi: 10.26760/mindjournal.

Siddik Muhammad and Sirait Azrai, “Pengembangan Sistem Informasi Administrasi Akademik Dengan Rancangan Modul Program Menggunakan Bahasa Pemrograman Berorientasi Objek,” in JOISIE , 2018, vol. 2, no. 1, pp. 51–57.

DOI: https://doi.org/10.32520/stmsi.v12i2.2795

Article Metrics

Abstract view : 222 times
PDF - 96 times

Refbacks

There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Username
Password
Remember me