Implementation of the Boyer Moore Algorithm in a Web-Based Accounting Terminology Dictionary Application

Azlan

Authors

Azlan STMIK Triguna Dharma, Medan, Indonesia

Keywords:

Implementation, Boyer Moore Algorithm, Dictionary Application, Accounting Terms

Abstract

The Boyer Moore algorithm is one of the most efficient string matching algorithms, known for using bad character and good suffix heuristics to speed up the process of searching for patterns in text. This study aims to implement the Boyer Moore algorithm in a web-based accounting dictionary application to improve efficiency in searching for terms that match the keywords used by users. The research method used is qualitative. The results of this study conclude that the Boyer-Moore algorithm is capable of providing efficient and accurate results in accounting term searches. By utilizing Occurrence Heuristic and Mismatch Heuristic, this algorithm speeds up the pattern matching process without checking the entire text, making it ideal for application in web-based accounting term dictionary applications that require fast, accurate, and responsive searches.

References

R. Y. Tsarev, A. S. Chernigovskiy, E. A. Tsareva, V. V Brezitskaya, A. Y. Nikiforov, and N. A. Smirnov, “Combined string searching algorithm based on knuth-morris- pratt and boyer-moore algorithms,” IOP Conf. Ser. Mater. Sci. Eng., vol. 122, p. 012034, Apr. 2016, doi: 10.1088/1757-899X/122/1/012034.

S. M. Morsy and D. Nashat, “VB-ARP : Boyer – Moore Majority Voting Algorithm Based Defense,” vol. 4, no. 4, pp. 172–177, 2024.

A. Aman Bangsa, B. Pramono, and L. Bahtiar Aksara, “Penerapan String Matching Menggunakan Algoritma Boyer Moore untuk Mencari Data Pada Website UMKM di Konawe Selatan,” Animator, vol. 2, no. 1, pp. 18–25, 2024, [Online]. Available: https://animator.uho.ac.id/index.php/journal/article/view/41

M. Kahfi Djardjani and D. Arwin Dermawan, “Penerapan Algoritma Boyer Moore untuk Pencarian Teks dalam Sistem Informasi Laporan Kerja di Fakultas Vokasi,” JMI (Jurnal Manaj. Inform., vol. 16, no. 2, p. 1, 2024, [Online]. Available: https://ejournal.unesa.ac.id/index.php/jurnal-manajemen-informatika/article/view/60962

Isnawati, D. Handayani, and A. Noeman, “a. Implementation of Boyer-Moore,” J. Inform. Inf. Secur., vol. 3, no. 1, pp. 49–58, 2022, doi: 10.31599/jiforty.v3i1.1182.

S. S. Abdul-Jabbar, A. K. Farhan, A. A. Abdelhamid, and M. E. Ghoneim, “Razy: A String Matching Algorithm for Automatic Analysis of Pathological Reports,” Axioms, vol. 11, no. 10, pp. 1–15, 2022, doi: 10.3390/axioms11100547.

F. A. T. Tobing, A. Chandra, and R. Nainggolan, “Penerapan Algoritma Knuth Morris Pratt (KMP) Pada Pencarian Data Di SQL Like Operators,” J. Widya, vol. 3, no. 1, pp. 50–58, 2022, [Online]. Available: https://doi.org/10.54593/awl.v3i1.82%0Ahttps://jurnal.amikwidyaloka.ac.id/index.php/awl/article/view/82/

L. Sernicula, M. Manalo, G. A. Niebre, R. Anastacio, J. Alagos, and J. Sermeno, “Analysis of the Enhanced Boyer-Moore Search Algorithm for a Desktop PC Search Engine,” J. Innov. Technol. Converg., vol. 5, no. 2, pp. 45–56, Dec. 2023, doi: 10.69478/JITC2023v5n2a05.

A. Mubarak, M. Ikhsan, and A. Putri, “Penerapan Web Semantik Berdasarkan Ontologi Pada Pencarian Judul Skripsi Dengan Algoritma Boyer-Moore,” J. Ilm. Komputasi, vol. 23, no. 2, pp. 189–200, 2024, doi: 10.32409/jikstik.23.2.3587.

R. Annisa, “Perancangan Kamus Istilah Akuntansi Berbasis Desktop Dengan Metode Interpolation Search,” Evolusi, vol. 5, no. 1, pp. 45–52, 2017.