TY  - BOOK
AU  - Emil Andre P. Cahila and Martin Carl M. Cuenca.
AU  - 
ED  - 
ED  - 
ED  - 
ED  - 
SN  - 2
PY  - 2019///.46
CY  - 
PB  - 
KW  - 
KW  - 2
KW  - 0
KW  - 6
KW  - 20
N1  - Thesis: (BSCS major in Computer Science)-Pamantasan ng Lungsod ng Maynila, 2019; 5
N2  - ABSTRACT:  	This study is about Levenshtein Algorithm. It is an algorithm or process of measuring the similarity between two strings, which we will refer to as the source string and the target string. The distance is the number of deletions, insertions, or substitutions required to transform the source to the target string. The main objective of this study is to enhance Levenshtein Algorithm to solve the all the problems underlying the algorithm. The researchers used different methods to solve the underlying problems. ASCII method - abbreviated from American Standard Code for Information Interchange, to correct the spelling and suggest words of the inputted string when it is typed in uppercase characters, HashMap with Bayer's Theorem, to filter the suggested words from the dictionary and return only the relevant and most popular candidates/matches of the inputted string and the language model to recognize and suggest the full form word for English honorifics. The results found by the help of these methods went successful in solving the algorithm's flaw. The researchers applied it as a Spell Checker system that corrects the word that are misspelled. Now, future researchers can further enhance the algorithm by applying the algorithm on an application with different platform
ER  -