Enhancement of Profanity Filtering and Hate Speech Detection Algorithm applied in Minecraft Chats

This study addresses critical limitations in an existing profanity-filtering algorithm: insufficient context interpretation and absence of leetspeak detection. First, the researchers integrated the BERT transformer model to improve context-sensitive filtering, achieving a 99.1% accuracy rate and a 10.4% increase in correctly censoring 1,000 chat results from the Minecraft-Server-Chat dataset. Toxicity scoring with Toxic-BERT allowed precise filtering, distinguishing between friendly and harmful content words. Second, the researchers incorporated a reverse mapping function to identify leetspeak, significantly improving censorship accuracy. In the dataset of 1,000 chats in Minecraft- Server-Chat dataset, 108 leetspeak inputs were analyzed. The Enhanced Algorithm demonstrates an 82.4% censorship success rate for leetspeak-masked inputs, reducing the error rate to 2.8% compared to the Existing Algorithm’s 28.7%. This gives the enhanced algorithm the accuracy rate of 97.2% in filtering leetspeak-masked profanity compared to the 71.3% of the existing algorithm. These advancements made the Enhanced Algorithm a robust, context-aware and accurate in leetspeaks for moderating Minecraft chats, fostering a safer and more inclusive online environment.

Authors

Publication Details

Journal
Technoarete Transactions on Advances in Computer Applications
Published
2025-01-01
DOI
https://doi.org/10.36647/ttaca/04.02.a001
Primary Topic
Hate Speech and Cyberbullying Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhancement of Profanity Filtering and Hate Speech Detection Algorithm applied in Minecraft Chats

Khatalyn E. Mata, Criselle J. Centeno, Raymund M. Dioses, Joseph Darwin C. Co et al.
Technoarete Transactions on Advances in Computer Applications
Hate Speech and Cyberbullying Detection
article

Enhancement of Profanity Filtering and Hate Speech Detection Algorithm applied in Minecraft Chats

Khatalyn E. Mata, Criselle J. Centeno, Raymund M. Dioses, Joseph Darwin C. Co, Jeffrey M. Daquigan, Gorel Kaiser G. Marbella
article en

Abstract

This study addresses critical limitations in an existing profanity-filtering algorithm: insufficient context interpretation and absence of leetspeak detection. First, the researchers integrated the BERT transformer model to improve context-sensitive filtering, achieving a 99.1% accuracy rate and a 10.4% increase in correctly censoring 1,000 chat results from the Minecraft-Server-Chat dataset. Toxicity scoring with Toxic-BERT allowed precise filtering, distinguishing between friendly and harmful content words. Second, the researchers incorporated a reverse mapping function to identify leetspeak, significantly improving censorship accuracy. In the dataset of 1,000 chats in Minecraft- Server-Chat dataset, 108 leetspeak inputs were analyzed. The Enhanced Algorithm demonstrates an 82.4% censorship success rate for leetspeak-masked inputs, reducing the error rate to 2.8% compared to the Existing Algorithm’s 28.7%. This gives the enhanced algorithm the accuracy rate of 97.2% in filtering leetspeak-masked profanity compared to the 71.3% of the existing algorithm. These advancements made the Enhanced Algorithm a robust, context-aware and accurate in leetspeaks for moderating Minecraft chats, fostering a safer and more inclusive online environment.

Technoarete Transactions on Advances in Computer ApplicationsVol. 4(2)
Openalex Percentile: Top 87%
Hate Speech and Cyberbullying Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.