An enhancement of the Boyer-Moore Algorithm applied in braille translation / Sarah B. Borja and Raffy C. Solayao. 6

By: Sarah B. Borja and Raffy C. Solayao. 4 0 16, [, ] | [, ] |
Contributor(s): 5 6 [] |
Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; March 2016.46Edition: Description: 28 cm. 74 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 researchers idea for this study is to choose the best algorithm suitable to the Braille Translation application. Through deep-research the researchers found out that the Boyer-Moore Algorithm is the best algorithm to apply in the application. In computer science, the Boyer-Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore in 1997. The algorithm preprocesses the string being searched for (the pattern), but not the string being searched in (the text). It is thus well-suited for applications in which the pattern is much shorter than the text or where it persists across multiple searches. The Boyer-Moore algorithm uses information gathered during the preprocess step to skip sections of the text, resulting in a lower constant factor that many other string algorithms. In general, the algorithm runs faster as the pattern length increases. The Key features of the algorithm are to match on the tail of the pattern than the head, and to skip along the text in jumps of multiple characters rather than searching every single character in the text. The researchers conducted a simulation of the algorithm and saw some processes that can be enhanced for it to perform better. These processes are used by the proponents as the problems of their study. These problems are: the preprocessing of the good suffix rule is too complex to implement, the algorithm doesn't work efficiently on small alphabets and the inability of the algorithm to compare the length of the pattern to the length of the current word or words it is aligned. For these problems to be solved, the proponents set the following objectives: to modify the preprocessing of the good suffix rule, to improve the Boyer-Moore Algorithm so that it can also work efficiently on small alphabets and to create a preprocess that will compare the length of the pattern to the length of the word or words it is aligned. With these objectives, the researchers was able to enhance the existing Boyer-Moore Algorithm. After the successful enhancement of the algorithm, it's finally applied in our application. The created application where the algorithm is applied will be a great contribution to different type of fields. 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)
Item type Current location Home library Collection Call number Status Date due Barcode Item holds
Book PLM
PLM
Filipiniana Section 		Filipiniana-Thesis QA76.9 B67 2016 (Browse shelf) Available FT6091
Total holds: 0

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

5

ABSTRACT: The researchers idea for this study is to choose the best algorithm suitable to the Braille Translation application. Through deep-research the researchers found out that the Boyer-Moore Algorithm is the best algorithm to apply in the application. In computer science, the Boyer-Moore string search algorithm is an efficient string searching algorithm that is the standard benchmark for practical string search literature. It was developed by Robert S. Boyer and J Strother Moore in 1997. The algorithm preprocesses the string being searched for (the pattern), but not the string being searched in (the text). It is thus well-suited for applications in which the pattern is much shorter than the text or where it persists across multiple searches. The Boyer-Moore algorithm uses information gathered during the preprocess step to skip sections of the text, resulting in a lower constant factor that many other string algorithms. In general, the algorithm runs faster as the pattern length increases. The Key features of the algorithm are to match on the tail of the pattern than the head, and to skip along the text in jumps of multiple characters rather than searching every single character in the text. The researchers conducted a simulation of the algorithm and saw some processes that can be enhanced for it to perform better. These processes are used by the proponents as the problems of their study. These problems are: the preprocessing of the good suffix rule is too complex to implement, the algorithm doesn't work efficiently on small alphabets and the inability of the algorithm to compare the length of the pattern to the length of the current word or words it is aligned. For these problems to be solved, the proponents set the following objectives: to modify the preprocessing of the good suffix rule, to improve the Boyer-Moore Algorithm so that it can also work efficiently on small alphabets and to create a preprocess that will compare the length of the pattern to the length of the word or words it is aligned. With these objectives, the researchers was able to enhance the existing Boyer-Moore Algorithm. After the successful enhancement of the algorithm, it's finally applied in our application. The created application where the algorithm is applied will be a great contribution to different type of fields.

5

There are no comments for this item.

to post a comment.

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