Claim Missing Document
Check
Articles

Found 2 Documents
Search
Journal : JOIN (Jurnal Online Informatika)

The Development Of Learning Media For Mobile Learning Application The Language And Automata Theory On Finite State Automata (FSA) And Deterministic Finite Automata (DFA) Material Use Adobe Air for Android Sulaiman, Maulana Muhamad; Andrianto, Romi; Yulianto, Muhamad Arief
JOIN (Jurnal Online Informatika) Vol. 5 No 2 (2020)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v5i2.630

Abstract

The language and automata theory are which required course must implemented by college student in informatic engineering study program. In this course, there are finite state automata (FSA) and deterministic finite automata (DFA) which are important materials in language and automata theory. This material requires more understanding of mathematical logic from students to determine an input which can be accepted or rejected in an abstract machine system. The assist students  to understand the material, it is need to develop the learning media for mobile learning applications for language  and automata theory on finite state automata (FSA) and deterministic finite automata (DFA) based on android as an evaluation of learning media for students. And the development of this learning media use the ADDIE development model (analysis, design, development, implementation, evaluation) to  design language and automata theory applications learning so can be support the learning process for students and then assist lecturer to explain the material more dynamic and applicative.
The Hybrid of Jaro-Winkler and Rabin-Karp Algorithm in Detecting Indonesian Text Similarity Yulianto, Muhamad Arief; Nurhasanah, Nurhasanah
JOIN (Jurnal Online Informatika) Vol 6 No 1 (2021)
Publisher : Department of Informatics, UIN Sunan Gunung Djati Bandung

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.15575/join.v6i1.640

Abstract

The String-matching technique is part of the similarity technique. This technique can detect the similarity level of the text. The Rabin-Karp is an algorithm of string-matching type. The Rabin-Karp is capable of multiple patterns searching but does not match a single pattern. The Jaro-Winkler Distance algorithm can find strings within approximate string matching. This algorithm is very suitable and gives the best results on the matching of two short strings. This study aims to overcome the shortcomings of the Rabin-Karp algorithm in the single pattern search process by combining the Jaro-Winkler and Rabin-Karp algorithm methods. The merging process started from pre-processing and forming the K-Gram data. Then, it was followed by the calculation of the hash value for each K-Gram by the Rabin-Karp algorithm. The process of finding the same hash score and calculating the percentage level of data similarity used the Jaro-Winkler algorithm. The test was done by comparing words, sentences, and journal abstracts that have been rearranged. The average percentage of the test results for the similarity level of words in the combination algorithm has increased. In contrast, the results of the percentage test for the level of similarity of sentences and journal abstracts have decreased. The experimental results showed that the combination of the Jaro-Winkler algorithm on the Rabin-Karp algorithm can improve the similarity of text accuracy.