Cover Image

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

Main Authors: Irawan, Candra, Pratama, Mudafiq Riyan
Format: Article info application/pdf eJournal
Bahasa: eng
Terbitan: Puslitbang Sinergis Asa Professional , 2020
Subjects:
String Matching
Boyer-Moore
Brute Force
Pencarian
KBBI
Online Access: http://bios.sinergis.org/index.php/bios/article/view/13
http://bios.sinergis.org/index.php/bios/article/view/13/9
ctrlnum article-13
fullrecord <?xml version="1.0"?> <dc schemaLocation="https://www.openarchives.org/OAI/2.0/oai_dc/ https://www.openarchives.org/OAI/2.0/oai_dc.xsd"><title lang="en-US">Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android</title><creator>Irawan, Candra</creator><creator>Pratama, Mudafiq Riyan </creator><subject lang="en-US">String Matching</subject><subject lang="en-US">Boyer-Moore</subject><subject lang="en-US">Brute Force</subject><subject lang="en-US">Pencarian</subject><subject lang="en-US">KBBI</subject><description lang="en-US">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.</description><publisher lang="en-US">Puslitbang Sinergis Asa Professional</publisher><date>2020-09-28</date><type>Journal:Article</type><type>Other:info:eu-repo/semantics/publishedVersion</type><type>Journal:Article</type><type>File:application/pdf</type><identifier>http://bios.sinergis.org/index.php/bios/article/view/13</identifier><identifier>10.37148/bios.v1i2.13</identifier><source lang="en-US">BIOS : Jurnal Teknologi Informasi dan Rekayasa Komputer; Vol 1 No 2 (2020); 54-60</source><source>2722-0850</source><source>10.37148/bios.v1i2</source><language>eng</language><relation>http://bios.sinergis.org/index.php/bios/article/view/13/9</relation><rights lang="en-US">Copyright (c) 2020 BIOS : Jurnal Teknologi Informasi dan Rekayasa Komputer</rights><rights lang="en-US">https://creativecommons.org/licenses/by-sa/4.0</rights><recordID>article-13</recordID></dc>
language eng
format Journal:Article
Journal
Other:info:eu-repo/semantics/publishedVersion
Other
File:application/pdf
File
Journal:eJournal
author Irawan, Candra
Pratama, Mudafiq Riyan
title Perbandingan Algoritma Boyer-Moore dan Brute Force pada Pencarian Kamus Besar Bahasa Indonesia Berbasis Android
publisher Puslitbang Sinergis Asa Professional
publishDate 2020
topic String Matching
Boyer-Moore
Brute Force
Pencarian
KBBI
url http://bios.sinergis.org/index.php/bios/article/view/13
http://bios.sinergis.org/index.php/bios/article/view/13/9
contents 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.
id IOS15280.article-13
institution Sinergis Asa Professional
institution_id 5769
institution_type library:public
library
library BIOS: Jurnal Teknologi Informasi dan Rekayasa Komputer
library_id 4360
collection BIOS : Jurnal Teknologi Informasi dan Rekayasa Komputer
repository_id 15280
city Jember
province JAWA TIMUR
repoId IOS15280
first_indexed 2021-03-05T06:19:11Z
last_indexed 2021-03-05T06:19:11Z
recordtype dc
_version_ 1693371838687608832
score 17.538404

Lihat Juga