Normal view MARC view ISBD view

A further enhancement of the Boyer-Moore-Horspool algorithm applied of LAN chat box profanity filtering / Daryl d. Bonzon and Ronald Harold Giene M. Indol. 6

By: Daryl d. Bonzon and Ronald Harold Giene M. Indol. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2012.46Edition: Description: 28 cm. 81 ppContent type: text Media type: unmediated Carrier type: volumeISBN: ISSN: 2Other title: 6 []Uniform titles: | | Related works: 1 40 6 []Subject(s): -- 2 -- 0 -- -- | -- 2 -- 0 -- 6 -- | 2 0 -- | -- -- 20 -- | | -- -- -- -- 20 -- | -- -- -- 20 -- --Genre/Form: -- 2 -- Additional physical formats: DDC classification: | LOC classification: | | 2Other classification:

Contents:

Action note: In: Summary: ABSTRACT: The Boyer-Moore-Horspool Algorithm is considered as one of the fastest string-searching algorithm of its time. It was used by programmers, developers and researchers alike for many various purposes. Most of them use it for their own application, some of them use it for dictionaries for easier searching. This study covers the major process of a string-searching algorithm but with an addition that made the Boyer-Moore-Hospool Algorithm, or BMH for short, a unique algorithm compared to other string searching algorithms. The said algorithm is in fact, simple to understand. It utilizes the some parts of the English grammar for accurate results. This study also encompasses a recent enhancement for the said algorithm that was used for a dictionary application. This study was able to procure some problems within the algorithm's enhancement such as its time constraint, input constraint and accuracy of its function. The research done was able to solve the said problems with a few revisions that did not alter the primary purpose of the algorithm. BMH algorithm has many different versions depending on the person who enhances it. This only proves that the said algorithm is in fact recent and timely, good for people who are interested in using it for other applications. Other editions:

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes
Comments ( 0 )

Item type	Current location	Home library	Collection	Call number	Status	Date due	Barcode	Item holds
Book	PLM	PLM Archives	Filipiniana-Thesis	T QA76.5.B66.2012 (Browse shelf)	Available		FT6146

Total holds: 0

Thesis: (BSCS major in Computer Science) Pamantasan ng Lungsod ng Maynila, 2012. 56

ABSTRACT: The Boyer-Moore-Horspool Algorithm is considered as one of the fastest string-searching algorithm of its time. It was used by programmers, developers and researchers alike for many various purposes. Most of them use it for their own application, some of them use it for dictionaries for easier searching. This study covers the major process of a string-searching algorithm but with an addition that made the Boyer-Moore-Hospool Algorithm, or BMH for short, a unique algorithm compared to other string searching algorithms. The said algorithm is in fact, simple to understand. It utilizes the some parts of the English grammar for accurate results. This study also encompasses a recent enhancement for the said algorithm that was used for a dictionary application. This study was able to procure some problems within the algorithm's enhancement such as its time constraint, input constraint and accuracy of its function. The research done was able to solve the said problems with a few revisions that did not alter the primary purpose of the algorithm. BMH algorithm has many different versions depending on the person who enhances it. This only proves that the said algorithm is in fact recent and timely, good for people who are interested in using it for other applications.

There are no comments for this item.

to post a comment.