UCSY's Research Repository

Implementation of Spell-Checking System by using Levenshtein Distance Algorithm

Show simple item record

dc.contributor.author Ko, Win
dc.date.accessioned 2019-08-03T03:49:01Z
dc.date.available 2019-08-03T03:49:01Z
dc.date.issued 2009-12-30
dc.identifier.uri https://onlineresource.ucsy.edu.mm/handle/123456789/1695
dc.description.abstract Natural Language Processing (NLP) is one of the most important research area carried out in the world of Artificial Intelligence (AI). NLP supports the tasks of a portion of AI such as Spell Checking,Machine Translation, and so on. Spell checking application presents valid suggestions to the user based on each mistake they encounter in the user’s document. The user then either makes a selection from a list of suggestions or accepts the current word as valid. Spell-checking program is often integrated with word processing that checks for the correct spelling of words in a document. Each word is compared against a dictionary of correctly spelt words. The user can usually add words to the spellchecker’s dictionary in order to customize it to his or her needs. This system is intended to develop a spell checker (or spell check) application program by using Levenshtein Distance algorithm. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.title Implementation of Spell-Checking System by using Levenshtein Distance Algorithm en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics