Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android

Irawan, Candra and Pratama, Mudafiq Riyan (2021) Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android. BIOS : Jurnal Teknologi Informasi dan Rekayasa Komputer, 1 (2). pp. 54-60. ISSN 2722-0850

WarningThere is a more recent version of this item available.
[img] Text (Hasil Cek Similarity)
Hasil Cek Similarity - Perbandingan Algoritma BoyerMoore dan Brute Force pada.pdf - Supplemental Material
Download (1MB)
Official URL: https://doi.org/10.37148/bios.v1i2.13

Abstract

String matching is an algorithm for matching a text to another text or also known as a text search. There are several algorithms that can be used for string matching, including the Boyer-Moore algorithm and the Brute Force algorithm. The Boyer-Moore algorithm is a string matching algorithm published by Robert S. Boyer and J. Strother Moore in 1977. This algorithm is considered the most efficient algorithm in general applications. The Boyer-Moore algorithm starts matching characters from the pattern on the right. While the Brute Force algorithm is an algorithm that matches a pattern with all text between 0 and n-m to find the existence of a pattern in the text. These two algorithms have different patterns in the search process. In this article, a comparative analysis of the performance of the Boyer-Moore and Brute Force algorithms is carried out in a case study of the search for the Big Indonesian Dictionary (KBBI) based on Android. The search process is carried out by searching based on words and word descriptions. The results of this study indicate that the criteria for running time, the Brute Force algorithm is faster than the Boyer-Moore algorithm with the total running time of the Brute Force algorithm is 168.3 ms in words, 6994.16 ms in word descriptions, while the Boyer-Moore algorithm for running time reached 304.7 ms on the word, 8654.77 ms on the word description. In the testing criteria based on related keywords, the two algorithms can display the same list of related keywords.

Item Type: Article
Subjects: 410 - Rumpun Ilmu Teknik > 450 - Teknik Elektro dan Informatika > 458 - Teknik Informatika
Divisions: Jurusan Kesehatan > Prodi D4 Manajemen Informasi Kesehatan > Publikasi
Depositing User: Mudafiq Riyan Pratama
Date Deposited: 23 Mar 2021 11:25
Last Modified: 23 Mar 2021 11:26
URI: https://sipora.polije.ac.id/id/eprint/2988

Available Versions of this Item

Actions (login required)

View Item View Item
Sistem Informasi Polije Repository Asset (SIPORA) is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.