Brute Force Algorithm Implementation Of Dictionary Search

Charles  Baturu; Naufal abdi

doi:10.54209/infosains.v10i1.29

Authors

Charles Baturu STMIK Pontianak
Naufal abdi STMIK Pontianak

DOI:

https://doi.org/10.54209/infosains.v10i1.29

Keywords:

Dictionary, Algoritma Brute Force , Searching

Abstract

In the manual dictionary the more words are accommodated, the heavier the dictionary. Dictionaries that are generally book-shaped are difficult to carry anywhere because they are thick and heavy. With this mobile-based computer dictionary application, users no longer need to carry heavy dictionaries and the search process will also be faster and easier. This mobile-based kmputer dictionary application is created using the java programming language with the NetBeans 7.0 editor and using an RMS (Record Management System) based database. So it can be installed on various types of mobile phones that already support Java. String Matching is one of the algorithms used to speed up the search process for the desired word. String matching algorithms have been used frequently before as examples in the process of matching strings based on the equation of text data namely Brute Force. Because this Brute Force algorithm can be used to perform string or text searches. Brute force algorithm is an algorithm to match a pattern with all text between 0 and n-m to find the presence of a pattern in text.

Downloads

Download data is not yet available.

References

J. Agape Sianturi, I. N. Piarsa, and I. K. Adi Purnawan, “Aplikasi Pencarian dan Penyewaan Rumah Kost Berbasis Web dan Android,” J. Ilm. Merpati (Menara Penelit. Akad. Teknol. Informasi), 2018, doi: 10.24843/jim.2018.v06.i03.p06.

N. Afif, “IMPLEMENTASI ALGORITMA BRUTE FORCE DALAM PERANCANGAN APLIKASI PENELUSURAN SKRIPSI,” Inform. Sains dan Teknol., vol. 3, 2018.

C. R. Gunawan, A. Ihsan, and M. Munawir, “Optimasi Penyelesaian Permainan Rubik’s Cube Menggunakan Algoritma IDA* dan Brute Force,” J. Infomedia, vol. 3, no. 1, 2018, doi: 10.30811/jim.v3i1.627.

S. S, “Implementasi Algoritma Brute Force Dalam Pencarian Kebudayaan Di Indonesia Berbasis Mobile Application,” Buffer Inform., vol. 4, no. 2, 2018, doi: 10.25134/buffer.v4i2.1472.

A. S. Sumi, P. Purnawansyah, and L. Syafie, “Analisa Penerapan Algoritma Brute Force Dalam Pencocokan String,” Pros. SAKTI (Seminar Ilmu Komput. dan Teknol. Informasi), vol. 3, no. 2, 2018.

R. Manivannan and S. K. Srivatsa, “Semi automatic method for string matching,” Inf. Technol. J., vol. 10, no. 1, 2011, doi: 10.3923/itj.2011.195.200.

T. Zebua and N. Silalahi, “Aplikasi Saran Buku Bacaan Bagi Pengunjung Perpustakaan AMIK STIEKOM Sumatera Utara Berdasarkan Algoritma Brute Force,” Jurasik (Jurnal Ris. Sist. Inf. dan Tek. Inform., vol. 3, 2018, doi: 10.30645/jurasik.v3i0.67.

Y. Yulianto, R. Ramadiani, and A. H. Kridalaksana, “Penerapan Formula Haversine Pada Sistem Informasi Geografis Pencarian Jarak Terdekat Lokasi Lapangan Futsal,” Inform. Mulawarman J. Ilm. Ilmu Komput., vol. 13, no. 1, 2018, doi: 10.30872/jim.v13i1.1027.

A. Rasool, A. Tiwari, G. Singla, and N. Khare, “String Matching Methodologies: A Comparative Analysis,” Int. J. Comput. Sci. Inf. Technol., vol. 3, no. 2, 2012.

D. W. T. PUTRA and J. J. PUTRA, “PERANCANGAN SISTEM INFORMASI PENCARIAN LOWONGAN PEKERJAAN,” J. TEKNOIF, vol. 6, no. 1, 2018, doi: 10.21063/jtif.2018.v6.1.48-54.

Y. Rohmiyati, “Model Perilaku Pencarian Informasi Generasi Milenial,” Anuva, vol. 2, no. 4, 2018, doi: 10.14710/anuva.2.4.387-392.

D. Ratnasari, D. B. Qur’ani, and A. Apriani, “Sistem Informasi Pencarian Tempat Kos Berbasis Android,” J. Inf., vol. 3, no. 1, 2018, doi: 10.25139/ojsinf.v3i1.657.