An enhanced of Boyer-Moore algorithm applied to profanity detection in Filipino-text (Record no. 37418)

000 -LEADER
fixed length control field 02729nam a22001817a 4500
003 - CONTROL NUMBER IDENTIFIER
control field FT8938
005 - DATE AND TIME OF LATEST TRANSACTION
control field 20260112124219.0
050 ## - LIBRARY OF CONGRESS CALL NUMBER
Classification number QA76.9 A43 D66 2025
100 1# - MAIN ENTRY--PERSONAL NAME
Personal name Domingo, John Michael M.; Martin, Mark Dave C.
245 ## - TITLE STATEMENT
Title An enhanced of Boyer-Moore algorithm applied to profanity detection in Filipino-text
264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE
Date of production, publication, distribution, manufacture, or copyright notice c2025
300 ## - PHYSICAL DESCRIPTION
Other physical details Undergraduate Thesis: (Bachelor of Science in Computer Science) - Pamantasan ng Lungsod ng Maynila, 2025
336 ## - CONTENT TYPE
Source text
Content type term text
Content type code text
337 ## - MEDIA TYPE
Source unmediated
Media type term unmediated
Media type code unmediated
338 ## - CARRIER TYPE
Source volume
Carrier type term volume
Carrier type code volume
505 ## - FORMATTED CONTENTS NOTE
Formatted contents note ABSTRACT: The Boyer-Moore algorithm’s performance can degrade when handling large datasets or complex patterns, particularly due to high memory usage and inefficiencies in processing repetitive sequences. The algorithm requires storing large tables or arrays, which increases resource consumption. Additionally, it may struggle when the text or patterns contain repetitions, leading to increased mismatch checks and inefficient shifts. This study proposes an enhancement to the Boyer-Moore algorithm by integrating hash tables to improve efficiency in handling large datasets and complex patterns while addressing execution time and memory usage challenges. The proposed method optimizes pattern preprocessing and matchmaking redundant computations and improving data access. Performance evaluation on datasets ranging from 100,000 to over 5 million characters demonstrated a 16.39% improvement in execution time, with the enhanced algorithm processing 5,289,118 characters in 1.64 seconds compared to 1.96 seconds for the original. Additionally, memory usage was reduced by approximately 1,210 KB across different dataset sizes, highlighting its scalability and resource efficiency. The enhancement also improves performance in scenarios with repetitive characters or sequences by reducing the number of mismatch checks and optimizing shifts, ensuring better adaptability to diverse text structures. These improvements make the algorithm highly suitable for real-time applications, including content moderation, search engines, and large-scale data analytics. The findings suggest that industries reliant on fast and efficient text processing can adopt this enhanced algorithm to meet growing computational demands. Future research should explore hybrid models, advanced data structures, and multilingual datasets to further optimize performance and validate its adaptability across different domains. The broader implications include supporting industries with scalable analytics tools, enhancing real-time processing capabilities, and fostering safer online environments through more effective content moderation.
942 ## - ADDED ENTRY ELEMENTS
Source of classification or shelving scheme
Item type Thesis/Dissertation
Holdings
Withdrawn status Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Permanent Location Current Location Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Price effective from Item type
          Filipiniana-Thesis PLM PLM Filipiniana Section 2025-10-24   QA76.9 A43 D66 2025 FT8938 2026-01-12 2026-01-12 Thesis/Dissertation

© Copyright 2024 Phoenix Library Management System - Pinnacle Technologies, Inc. All Rights Reserved.