Ramadhanty, Siti (2021) Perbandingan Algoritma Boyer-Moore dan Levenshtein Distance dalam Chatbot. Tugas Akhir thesis, University of Technology Yogyakarta.
|
Text
ABSTRAK_5150411209_SITI RAMADHANTY.pdf Download (8kB) | Preview |
Abstract
ABSTRACT Yogyakarta is one of the cities in Indonesia which is famous for its culture, traditions and natural beauty which can attract many tourists. Information about tourism in Yogyakarta can be found in various media such as websites, newspapers, advertisements and so on, but these media cannot provide interactive information such as chatbots. This study aims to build a chatbot application that can make it easier for tourists to find tourist information quickly and interactively using the Telegram application. The Boyer-Moore algorithm and the Levenshtein Distance algorithm are used to find the right answer according to the questions from the user. Based on the results of system testing using confusion matrix, the accuracy rate of chatbot with Boyer-Moore algorithm is 50% and chatbot with Levenshtein Distance algorithm is 50%. With the average speed of duration answering the Boyer-Moore algorithm is 3.145 and the Levenshtein Distance algorithm is 3.968. So that in this study it can be concluded that the Boyer-Moore algorithm is better than the Levenshtein Distance algorithm, in searching for answers on the chatbot application. Keywords: Chatbot, Tourism, Algorithm, Boyer Moore, Levenshtein Distance
| Item Type: | Thesis (Skripsi, Tugas Akhir or Kerja Praktek) (Tugas Akhir) |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Fakultas Sains Dan Teknologi > S1 Informatika |
| Depositing User: | Kaprodi S1 Informatika UTY |
| Date Deposited: | 24 Mar 2021 06:39 |
| Last Modified: | 24 Mar 2021 06:39 |
| URI: | http://eprints.uty.ac.id/id/eprint/7129 |
Actions (login required)
 |
View Item |
