Article Per Year (5 Year)
p-Index From 2021 - 2026
0.23
P-Index
This Author published in this journals
All Journal TIN: TERAPAN INFORMATIKA NUSANTARA
Yogi Maulana
IIB Darmajaya, Bandar Lampung
Aerospace Engineering Arts Automotive Engineering Biochemistry, Genetics & Molecular Biology Chemical Engineering, Chemistry & Bioengineering Civil Engineering, Building, Construction & Architecture Computer Science & IT Decision Sciences, Operations Research & Management Dentistry Earth & Planetary Sciences Economics, Econometrics & Finance Energy Engineering Environmental Science Health Professions Immunology & microbiology Industrial & Manufacturing Engineering Law, Crime, Criminology & Criminal Justice Materials Science & Nanotechnology Mathematics Mechanical Engineering Medicine & Pharmacology Neuroscience Nursing Physics Social Sciences Veterinary Other

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Implementasi Algoritma Boyer-Moore untuk Otomatisasi Penyaringan Teks Konten Negatif pada Naskah Buku Anak Yogi Maulana
TIN: Terapan Informatika Nusantara Vol 7 No 1 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/tin.v7i1.9858

Abstract

The advancement of digital media increases the risk of exposure to negative content in children’s books, while manual curation in educational institutions is hampered by inefficiencies. This study implements the Boyer-Moore algorithm integrated with Regular Expressions (Regex) to automate text screening based on the quality standards of Ministry of Education, Culture, Research, and Technology Regulation No. 22 of 2022. This study contributes by providing a Regex integration scheme as a pre-processing component that dynamically normalizes variations in obfuscated text before execution by the Boyer-Moore character-jumping mechanism, an approach that has not been widely explored in regulatory manuscript filtering systems. Test results on 40 documents show that the system achieves a 95% success rate specifically in detecting exact matches of prohibited words listed in the database, with an average execution time of 0.000107 seconds per document. These results demonstrate that this combination of methods provides a highly efficient technical solution for reducing the initial curation workload, although its implementation is still limited to a dictionary-based approach and does not yet incorporate semantic context understanding.
Co-Authors