Implementation and Analysis Zhu-Takaoka Algorithm and Knuth-Morris-Pratt Algorithm for Dictionary of Computer Application Based on Android

Handrizal, Handrizal; Budiman, Andri; Ardani, Desy Rahayu

doi:10.30645/ijistech.v1i1.2

Cited by 3 publications

(3 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The Knuth-Morris-Pratt algorithm is used to improve the performance of searching Indonesian words that will be translated [9]. Handrizal et al (2017) analyzed the usage of the Knuth-Morris-Pratt algorithm to create a simple English to English dictionary. If the pattern inputted by the user is found in the dictionary, then the application will display the words that contain the said pattern, as well as the definition of the words.…”

Section: Learning Languagesmentioning

confidence: 99%

See 1 more Smart Citation

Translation Learning Tool for Local Language to Bahasa Indonesia using Knuth-Morris-Pratt Algorithm

Warnars¹,

Aurellia²,

Saputra³

2021

TEM Journal

View full text Add to dashboard Cite

During the COVID-19 pandemic time, it is a requirement to deliver online learning since students can not have face-to-face meetings and they depend on gadgets such as a computer, mobile phone, iPad, and laptop to continue their study. One of the subjects is local language learning as this subject is a requirement in some provinces in Indonesia as a gesture concerning local wisdom. However, there is a lack of support for learning the local language since the local languages have a mouth to mouth learning knowledge without any dictionary support. This paper proposed the idea of using the Knuth-Morris-Pratt algorithm to translate the Palembang language to Bahasa Indonesia to help students to learn the Palembang language with the application.

show abstract

Section: Learning Languagesmentioning

confidence: 99%

“…If the pattern inputted by the user is found in the dictionary, then the application will display the words that contain the said pattern, as well as the definition of the words. The complexity of the Knuth-Morris-Pratt algorithm is θ(m + n), where θ(m) is the preprocessing phase and θ(n) is the searching phase [16].…”

Section: Learning Languagesmentioning

confidence: 99%

Translation Learning Tool for Local Language to Bahasa Indonesia using Knuth-Morris-Pratt Algorithm

Warnars¹,

Aurellia²,

Saputra³

2021

TEM Journal

View full text Add to dashboard Cite

show abstract

“…However, a comparison of the performance of the KMP, Naïve, and BM algorithms in processing various text sizes concluded that the BM algorithm has the best and most efficient performance for large text sizes [4]. A word search in the dictionary with the Zhu-Takaoka and KMP algorithm is found that the Zhu-Takaoka algorithm is faster than the KMP algorithm [5]. The Zhu-Takaoka algorithm starts searching from the end of the pattern adapted to the text, but in the KMP algorithm, it starts from the beginning of the model.…”

Section: Introductionmentioning

confidence: 99%