Open AccessImplementation of Not So Naive and Burkhard-Keller Tree algorithms in Indonesian-Hokkien dictionary application
Author(s) -
Mohammad Andri Budiman,
Dian Rachmawati,
Charity
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1898/1/012028
Subject(s) - indonesian , computer science , trie , tree (set theory) , algorithm , search engine indexing , artificial intelligence , mathematics , data structure , programming language , linguistics , combinatorics , philosophy
In Indonesia, especially in Medan, North Sumatra, Hokkien is used in everyday life within the Chinese community. However, learning the language is still done manually. Therefore, the authors intend to create an Android-based Hokkien dictionary application. The most common typing errors found were deleting and inserting single characters, substituting and reversing adjacent characters. Exact string matching can perform a quick search, but the search will fail when the incorrect input is entered. This study aims to prove the advantages and disadvantages of each algorithm in accessing information in addition to displaying the results of the running time of both algorithms. The results showed that the search time for the Burkhard-Keller Tree algorithm increased by 72% and 96% for the Not So Naive algorithm when searching on a database containing 200 words and 400 words. The Not So Naive algorithm has a mean running time of 26.9 ms and a mean running time of 53.5 ms on the Burkhard-Keller Tree algorithm.