Cunanan. Sarah Jane S. and Sapnay, Mary Joyce H. 4 0
A Further enhancement of Boyer-Moore Horspool algorithm for dictionary to be applied in MS Word 2007 / 6 6 Cunanan. Sarah Jane S. and Sapnay, Mary Joyce H. - - - 82 pp. 28 cm. - - - - - . - . - 0 . - . - 0 .
Undergraduate Thesis (BS in Computer Science) - Pamantasan ng Lungsod ng Maynila, c2010.
5
ABSTRACT: String-matching algorithm are a very significant subject in the wide domain of text processing. It is also an important class of string algorithms that try to find a place where one or several strings or patterns are found within a larger string or text. There are many existing algorithms available to find the occurrence of a pattern within another string or body of text. One of those best algorithms is the Boyer-Moore Hospool. A further enhancement of this string matching algorithm is very useful for dictionary to be applied in Microsoft Word 2007. This application may be of great help in the communication process. A number of these have been done about this algorithm and through the analysis of the previous study, the proponents came up with the following problems. 1. The existing algorithm cannot give results when the input is an acronym. How will the existing algorithm be able to give accurate result when the user input an acronym? 2. The algorithm can accept words with hyphen/s and space/s in between but it lacks the capability to give accurate results. How will the existing algorithm be able to give accurate results to input with hyphens and spaces in between> 3. The algorithm doesn't give related results when the inputted word (misspelled) is not found the in the database. How will the existing algorithm be able to process the input that doesn't exist in the database bu checking for other related words base on the input? These problems was made to be solved. In line with that proponents set the following objectives: 1. To improve the accuracy of the algorithm by adding a process that will search when the imput is an acronym. 2. To further enhance the algorithm by giving accurate results when the input words has a space/s or hyphen's in between. 3. To be able to process string input that doesn't exist in the database by checking for other related words or strings based on the input. This study is mainly concerned with improvement of the Boyer-Moore Horspool algorithm for the application Dictionary to be applied in MS Word 2007. This application accepts word/s and acronyms. Using the Boyer-Moore Hospool algorithm, it will compare the input words or acronyms to the words listed in the database. If the word/s or acronym doesn't exist in the database, the dictionary will suggest words that are literally related to the input. This application is not case sensitive. However, the user must type in the correct spelling of the word because one of the study;s limitations is that this application cannot correct misspelled words which are inputted by the user. Rather, it may give word suggestions nearest and based on the input of the user. The proponents intend to apply this application to Microsoft Word 2007 as an additional function. This may serve as a bridge to further enhance the communication process. The proponents commend to further study the algorithm and try to apply it in different fields apart from the dictionary. However, if the next proponents likely to enhance the current algorithm the proponents would like to suggest having a voice over that will allow the user to hear the right pronunciation of the word. Moreover try to think of a way to be able to correct the spelling of the word if the user's input is misspelled and also seek of a method or technique to minimize the process for getting the root word of the input.
5
2 = =
2
2 --0------
6 --0-- 2 --------
0 2 --
--20------
--------20--
--------20--
----2
/ 2
/ 2
/
/
A Further enhancement of Boyer-Moore Horspool algorithm for dictionary to be applied in MS Word 2007 / 6 6 Cunanan. Sarah Jane S. and Sapnay, Mary Joyce H. - - - 82 pp. 28 cm. - - - - - . - . - 0 . - . - 0 .
Undergraduate Thesis (BS in Computer Science) - Pamantasan ng Lungsod ng Maynila, c2010.
5
ABSTRACT: String-matching algorithm are a very significant subject in the wide domain of text processing. It is also an important class of string algorithms that try to find a place where one or several strings or patterns are found within a larger string or text. There are many existing algorithms available to find the occurrence of a pattern within another string or body of text. One of those best algorithms is the Boyer-Moore Hospool. A further enhancement of this string matching algorithm is very useful for dictionary to be applied in Microsoft Word 2007. This application may be of great help in the communication process. A number of these have been done about this algorithm and through the analysis of the previous study, the proponents came up with the following problems. 1. The existing algorithm cannot give results when the input is an acronym. How will the existing algorithm be able to give accurate result when the user input an acronym? 2. The algorithm can accept words with hyphen/s and space/s in between but it lacks the capability to give accurate results. How will the existing algorithm be able to give accurate results to input with hyphens and spaces in between> 3. The algorithm doesn't give related results when the inputted word (misspelled) is not found the in the database. How will the existing algorithm be able to process the input that doesn't exist in the database bu checking for other related words base on the input? These problems was made to be solved. In line with that proponents set the following objectives: 1. To improve the accuracy of the algorithm by adding a process that will search when the imput is an acronym. 2. To further enhance the algorithm by giving accurate results when the input words has a space/s or hyphen's in between. 3. To be able to process string input that doesn't exist in the database by checking for other related words or strings based on the input. This study is mainly concerned with improvement of the Boyer-Moore Horspool algorithm for the application Dictionary to be applied in MS Word 2007. This application accepts word/s and acronyms. Using the Boyer-Moore Hospool algorithm, it will compare the input words or acronyms to the words listed in the database. If the word/s or acronym doesn't exist in the database, the dictionary will suggest words that are literally related to the input. This application is not case sensitive. However, the user must type in the correct spelling of the word because one of the study;s limitations is that this application cannot correct misspelled words which are inputted by the user. Rather, it may give word suggestions nearest and based on the input of the user. The proponents intend to apply this application to Microsoft Word 2007 as an additional function. This may serve as a bridge to further enhance the communication process. The proponents commend to further study the algorithm and try to apply it in different fields apart from the dictionary. However, if the next proponents likely to enhance the current algorithm the proponents would like to suggest having a voice over that will allow the user to hear the right pronunciation of the word. Moreover try to think of a way to be able to correct the spelling of the word if the user's input is misspelled and also seek of a method or technique to minimize the process for getting the root word of the input.
5
2 = =
2
2 --0------
6 --0-- 2 --------
0 2 --
--20------
--------20--
--------20--
----2
/ 2
/ 2
/
/