Normal view MARC view ISBD view

An enhancement of levenstein algorithm applied in spell checker system / Emil Andre P. Cahila and Martin Carl M. Cuenca. 6

By: Emil Andre P. Cahila and Martin Carl M. Cuenca. 4 0 16, [, ] | [, ] |

Contributor(s): 5 6 [] |

Language: Unknown language code Summary language: Unknown language code Original language: Unknown language code Series: ; Marc h 2019.46Edition: Description: 28 cm. 41 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: 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. 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	QA76.9.Ib8.2019 (Browse shelf)	Available		FT7081

Total holds: 0

Browsing PLM Shelves , Shelving location: Archives , Collection code: Filipiniana-Thesis Close shelf browser

Previous	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	No cover image available	Next
Previous	QA76.9.D38.2016 (519) Further enhancement of Daerau-Levenshtein Distance algorithm applied in plagiarism detection /	QA76.9.D56.2019 An enhancement of the structure of burrows-wheeler compression algorithm applied in text encryption /	QA76.9.G85.2018 An enhancement of digital signature algorithm used in data authentication applied in Kelopatra /	QA76.9.Ib8.2019 An enhancement of levenstein algorithm applied in spell checker system /	QA76.9.L33.2017 Jflate algorithm: a combination of Jbig2 and deflate applied in PDF file compression /	QA76.9.V47.2018 An enhancement of passface algorithm for computer application's graphical password authentication /	QA76.95.B48.2011 (478) An enhancement of two dimensional rabin karp algorithm applied to plagiarism detection /	Next

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

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.

There are no comments for this item.

to post a comment.