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

2021 ◽  
Vol 1 (2) ◽  
pp. 54-60
Author(s):  
Candra Irawan ◽  
Mudafiq Riyan Pratama
Keyword(s):  
String Matching ◽  
Search Process ◽  
Brute Force ◽  
Text Search ◽  
Matching Algorithm ◽  
Running Time ◽  
The Right ◽  
Bahasa Indonesia ◽  
Testing Criteria

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.

PERANCANGAN APLIKASI TRANSLATOR BAHASA INDONESIA KE BAHASA INGGRIS ESP (ENGLISH FOR SPECIFIC PURPOSE) KOMPUTER SAINS UNTUK PENINGKATAN INFORMASI MAHASISWA MENGGUNAKAN BRUTE FORCE METHOD

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Fince Tinus Waruwu ◽  
Putri Ramadhani
Keyword(s):  
String Matching ◽  
Foreign Languages ◽  
Brute Force ◽  
Search Technique ◽  
Text Search ◽  
Matching Algorithm ◽  
Force Method ◽  
Brute Force Method ◽  
String Search ◽  
Bahasa Indonesia

Translator is a tool to assist in translating a language from another language. Translator is very useful for tourists when traveling to other countries or other regions that do not understand the language of the country or area visited. Translator is also very useful for a student or student to learn and add knowledge about foreign languages that are not understood. The availability of translators in a university to improve services for students or those who need them. Students don't all understand foreign languages. String matching is a search technique in a text that is often called string search. String matching is often used in text search, location search, dictionary and so on. String matching has several algorithms, including brute force, boyer moore, knuth morris pratt and many more algorithms contained in string mathing. The Indonesian to English translator application uses the string mathing brute force algorithm. Brute force algorithm is matching each character from left to right.Keywords: Translator, String Matching, Algorithm, Brute Force

Implementasi Algoritma Raita Pada Aplikasi Hukum Kanonik Berbasis Mobile

2020 ◽  
Vol 7 (3) ◽  
pp. 455
Author(s):  
Efidoren L Nainggolan ◽  
Muhammad Syahrizal ◽  
Saidi Ramadan Siregar
Keyword(s):  
Catholic Church ◽  
Canon Law ◽  
String Matching ◽  
Eastern Orthodox ◽  
Orthodox Church ◽  
Matching Algorithm ◽  
Church Law ◽  
The Right ◽  
The Church ◽  
Eastern Orthodox Church

Canonical law is an internal church law governing the Catholic Church, Eastern Orthodox Church, Eastern Orthodox Church, Anglican Communion. How the laws of the church are governed, interpreted and sometimes examined differ fundamentally between the three church bodies. in all three traditions, a canon was originally a rule accepted by an assembly, these canons formed the basis for canon law. Raita algorithm is part of the exact string matching algorithm, which is matching the string exactly with the arrangement of characters in the matched string that has the same number or sequence of characters in the string. Matching strings on the raita algorithm is done through a shift from the right of the character then to the left of the character and to the middle of the character. The problem in this research is the content of canon law in general consists of a very large number of pages of books, this makes it difficult for canonical law users to find the contents needed, then in the search it takes time to find the contents of canonical law that are searched for too many search problems. that is, too much time must be needed to find the contents of the canonical law sought

scholarly journals Manajemen jpeg/exif file fingerprint dengan algoritma Brute Force string matching dan Hash Function SHA256

2019 ◽  
Vol 5 (2) ◽  
pp. 140
Author(s):  
Rachmad Fitriyanto ◽  
Anton Yudhana ◽  
Sunardi Sunardi
Keyword(s):  
Digital Signature ◽  
Hash Function ◽  
String Matching ◽  
Data Integrity ◽  
Brute Force ◽  
Matching Algorithm ◽  
Digital Signature Algorithm ◽  
Image Segment ◽  
Metadata File ◽  
Fourth Step

Management of jpeg/exif file fingerprint with Brute Force string matching algorithm and Hash Function SHA256Metode pengamanan berkas gambar jpeg/exif saat ini hanya mencakup aspek pencegahan, belum pada aspek deteksi integritas data. Digital Signature Algorithm (DSA) adalah metode kriptografi yang digunakan untuk memverifikasi integritas data menggunakan hash value. SHA256 merupakan hash function yang menghasilkan 256-bit hash value yang berfungsi sebagai file fingerprint. Penelitian ini bertujuan untuk menyusun file fingerprint dari berkas jpeg/exif menggunakan SHA256 dan algoritma Brute Force string matching untuk verifikasi integritas berkas jpeg/exif. Penelitian dilakukan dalam lima tahap. Tahap pertama adalah identifikasi struktur berkas jpeg/exif. Tahap kedua adalah akuisisi konten segmen. Tahap ketiga penghitungan hash value. Tahap keempat adalah eksperimen modifikasi berkas jpeg/exif. Tahap kelima adalah pemilihan elemen dan penyusunan file fingerprint. Hasil penelitian menunjukkan sebuah jpeg/exif file fingerprint tersusun atas tiga hash value. SOI (Start of Image) segment hash value digunakan untuk mendeteksi terjadinya modifikasi berkas dalam bentuk perubahan tipe berkas dan penambahan objek pada konten gambar. Hash value segmen APP1 digunakan untuk mendeteksi modifikasi pada metadata berkas. Hash value segmen SOF0 digunakan untuk mendeteksi gambar yang dimodifikasi dengan teknik recoloring, resizing, dan cropping. The method of securing jpeg/exif image files currently has covered only the prevention aspect instead of the data integrity detection aspect. Digital Signature Algorithm is a cryptographic method used to verify the data integrity using hash value. SHA256 is a hash function that produces a 256-bit hash value functioning as a fingerprint file. This study aimed at compiling fingerprint files from jpeg/exif files using SHA256 and Brute Force string matching algorithm to verify the integrity of jpeg/exif files. The research was conducted in five steps. The first step was identifying the jpeg/exif file structure. The second step was the acquisition of the segment content. The third step was calculating the hash value. The fourth step was the jpeg/exif file modification experiment. The fifth step was the selection of elements and compilation of fingerprint files. The obtained results showed a jpeg/exif fingerprint file which was compiled in three hash values. The hash value of SOI segment was used to detect the occurrence of file modification in the form of file type changing and object addition on the image content. The hash value of APP1 segment was used to detect the metadata file modification. The hash value of SOF0 segment was used to detect the images modified by recoloring, resizing, and cropping techniques.

Implementasi Algoritma Simon Pada Aplikasi Kamus Perubahan Fi’il (Kata Kerja Bahasa Arab) Berbasis Android

2021 ◽  
Vol 13 (1) ◽  
pp. 12-18
Author(s):  
Rahmad Akbar ◽  
Bambang Pramono ◽  
Rizal Adi Saputra
Keyword(s):  
String Matching ◽  
Running Time ◽  
Bahasa Indonesia

Kata kunci—Algoritma String Matching, Algoritma Simon, Kamus Perubahan Fi’il Android               Ilmu Shorof atau Tashrif adalah bidang keilmuan derivasi kata dalam Bahasa Arab, salah satu fokus pembahasan bidang ilmu tersebut ialah proses perubahan kata kerja atau disebut juga dengan Fi’il menjadi beberapa jenis kata yang lain, seperti Fi’il Mudhori’, Fi’il Madhi, Fi’il Amr, Fi’il Nahi, Isim Fa’il, Isim Maf’ul, Isim Zaman, Isim Makan, Isim Alat, Masdar maupun Masdar mim. Proses pembelajaran ilmu Shorof masih banyak dilakukan dengan cara tradisional, terutama dilingkungan pesantren dengan cara menghafal turunan-turunan kata tersebut beserta terjemahanya. Sedangkan salah satu kitab dasar yang sering digunakan ialah kitab Amtsilah At-Tashrifiyah karangan KH.Ma'shum bin Ali sebagai rujukan  proses perubahan kata, sedangakan untuk mencari terjemahan dalam Bahasa Indonesia harus menggunakan kamus Arab-Indonesia. Penelitian ini bertujuan untuk mempermudah proses pencarian kata dengan cara membuat kamus perubahan Fi’il berbasis android dan memanfaatkan Algoritma Simon sebagai metode pencarian katanya, sehingga dapat mempermudah proses pembelajaran ilmu Shorof. Algoritma Simon merupakan salah satu algoritma string matching  dengan fase pencocokannya dilakukan dari kiri ke kanan dengan tahapan inisialisasi tiap indeks pada pola yang diberikan. Setelah  dilakukan pengujian, proses pencarian kata dapat dilakukan dengan rata-rata running time yang dibutuhkan selama 3,67097786 mili second untuk pencarian kata dalam Bahasa Indonesia dan 23,8447333 mili second  untuk pencarian kata dalam Bahasa Arab

IMPLEMENTASI ALGORITMA RAITA SEARCH PADA APLIKASI FILSAFAT BERBASIS ANDROID

2018 ◽  
Vol 2 (1) ◽  
Author(s):  
Ratih Anggraini ◽  
Nelly Astuti Hasibuan ◽  
Suginam Suginam ◽  
Fince Tinus Waruwu
Keyword(s):  
Efficient Solution ◽  
Search Algorithm ◽  
String Matching ◽  
Search Process ◽  
Far Right ◽  
Matching Algorithm ◽  
Search Results ◽  
Search Feature ◽  
Long Time

Philosophy is the search for truth through a systematic flow of thinking, meaning that conversations about everything are carried out regularly following the prevailing system so that the stages are easy to follow. Etymologically philosophy comes from English and Greek, namely "philosophy" and "philein". This often causes difficulties to understand the meaning of the term philosophy. The term philosophy in general has a very large number so that to do the search for the meaning of the term philosophy in a philosophical book in the form of a printed book takes a long time because it must open one by one the book manually. To solve the problems described above the author builds an Android-based Philosophy application using eclipse juno. In order to simplify the search process for philosophical terms, the Raita search algorithm is implemented in the search feature contained in the Philosophy application. The raita search algorithm is a string matching algorithm with the arrangement of characters in a matched string that has the number and sequence of characters in the same string. Raita designed an algorithm by comparing the last character of the pattern starting from the far right character of the window. Android-based philosophy application that was built by the author in this study is expected to be an effective and efficient solution to get the search results of the meaning of the term philosophy in understanding the meaning of the term philosophy.Keywords: Implementation, Raita Search Algorithm, Philosophy Application, Android.

scholarly journals Perancangan Aplikasi Pencarian Makna Motif Batik Menggunakan Metode Galil Seiferas

2020 ◽  
Vol 7 (2) ◽  
pp. 264
Author(s):  
Lisa Wardani
Keyword(s):  
Search Algorithm ◽  
Human Life ◽  
String Matching ◽  
The Internet ◽  
Search Process ◽  
Search For Meaning ◽  
Search System ◽  
The People ◽  
Word Search ◽  
The Right

For some people batik is only a cloth that is a characteristic of Indonesia, especially the area of Java, but not everyone knows that every motif on batik cloth has its own philosophical meaning where each meaning is closely related to human life. As the people of Indonesia it helps us to know the meaning behind the beauty of batik motifs, but not everyone knows the name of batik motifs and can search for meaning on the internet or what we often call browsing. The solution that can be done is to create an Android-based batik meaning search system that can provide convenience in searching for the meaning of batik motifs. Search is designed in an application that helps word search using string matching, the Galil Seiferas search algorithm. With the implementation of Seiferas Galil Algorithm on the Android-based batik meaning search system, it is expected to be able to carry out the right search process in displaying the meaning of batik motifs as well as being easier and faster. The system built is also very practical because it is based on Android, so it can make it easier for users to access anywhere

Analisis Algoritma Rabin-Karp Pada Kamus Umum Berbasis Android

2017 ◽  
Vol 2 (1) ◽  
pp. 64 ◽  
Author(s):  
Herriyance Herriyance ◽  
Handrizal Handrizal ◽  
Siti Dara Fadilla
Keyword(s):  
String Matching ◽  
Base Number ◽  
Matching Algorithm ◽  
Running Time ◽  
Average Running Time ◽  
Considerable Impact

Development of the era had a considerable impact on the existence of a language. To overcome this there are some efforts to be made, one of which is to create a dictionary, a dictionary that was made to be practical and quick in use. Dictionary in question is a dictionary based on Android. To create a dictionary-based android can use string matching algorithm, one of the string matching algorithm is the Rabin-Karp algorithm, Rabin-Karp algorithm perform string matching hash value based on the text and the pattern hash value. The study produced an android based dictionary application which the base number is used to generate a hash value greatly affects the speed of search words. Average running time of 10 attempts to search for words is 14.9 ms.

Sign in / Sign up

Export Citation Format

Share Document