Please use this identifier to cite or link to this item:
https://repository.uksw.edu/handle/123456789/11370
Title: | 3 Studi Perbandingan Algoritma Brute Force, Algoritma KnuthMorris-Pratt, Algoritma Boyer-Moore untuk Identifikasi Kesalahan Penulisan Teks berbasis Android |
Authors: | Geraldy, Ditya |
Keywords: | pencarian string;Brute Force;Knuth-Morris-Pratt;Boyer-Moore;kesalahan penulisan teks;aplikasi android |
Issue Date: | 2016 |
Publisher: | Program Studi Teknik Informatika FTI-UKSW |
Abstract: | Efisiensi waktu dan kemungkinan adanya human error, dapat mengakibatkan proses manual pengecekan kata dalam perangkat mobile menjadi tidak optimal. Karena itu diperlukan suatu sistem untuk identifikasi kesalahan penulisan teks. Salah satu pendekatan yang dapat diterapkan adalah metode pencarian string. Beberapa algoritma terkenal yang sering digunakan dalam pencarian string adalah algoritma Brute Force, Knuth-Morris-Pratt dan Boyer-Moore. Algoritma pencarian string dapat diterapkan dalam Android, yang juga merupakan sistem operasi mobile yang paling banyak digunakan di dunia. Banyaknya algoritma pencarian string, membuka peluang untuk membandingkan performa algoritma-algoritma pencarian string. Perbandingan beberapa algoritma pencarian string seperti algoritma Brute Force, Knuth-Morris-Pratt, Boyer-Moore belum pernah dilakukan dalam aplikasi Android. Sehingga dibuat sebuah aplikasi untuk membandingkan algoritma-algoritma pencarian string untuk identifikasi kesalahan penulisan teks berbasis Android. Time efficiency and possibility of human error, can make the manual process of checking words in mobile device not optimal. Therefore, need a system to identify text writing error. One of the approaches that can be applied is the string searching methods. Some famous algorithms which often used in the string searching are Brute Force, Knuth-Morris-Pratt and Boyer-Moore algorithm. String searching algorithm can be applied in Android, which is also the most used mobile operating system in the world. Number of string searching algorithms, provide an opportunity to compare the performance of string searching algorithms. Comparison of some string searching algorithms such as Brute Force, Knuth-Morris-Pratt, Boyer-Moore algorithm had never been done in the Android application. So made an application to compare string searching algorithms for text writing error identification based on Android. |
URI: | http://repository.uksw.edu/handle/123456789/11370 |
Appears in Collections: | T1 - Information Engineering |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
T1_672011064_Abstract.pdf | Abstract | 131.49 kB | Adobe PDF | View/Open |
T1_672011064_Full text.pdf | Full text | 3.13 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.