UCSY's Research Repository

Myanmar Words Spelling Checking Using Levenshtein Distance Algorithm

Show simple item record

dc.contributor.author Oo, Nwe Zin
dc.contributor.author Htwe, Tin Myat
dc.date.accessioned 2019-07-12T05:41:35Z
dc.date.available 2019-07-12T05:41:35Z
dc.date.issued 2010-12-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/861
dc.description.abstract Natural Language Processing (NLP) is one of the most important research area carried out in the world of Artificial Intelligence (AI). Spelling Checking, Machine Translation, Automatic Text Summarization, Information Extraction and Automatic Text Categorization Information Retrieval are included in NLP. A Myanmar Spelling Checker is an essential component of many of the common desktop applications such word processors as well as the more exotic applications. In this system, it proposes the process of checking the spelling of a Myanmar input word and suggestion list if it is misspelled Myanmar word. This system is intended to develop a Myanmar Language Spell Checker (or spell check) by using Levenshtein Distance Algorithm. Moreover, Dynamic Threshold Algorithm and Transformation Algorithm are used in Myanmar Spelling Checking. This system uses Zawgyi Myanmar Font and implements using Java Language and MySQL Server. This thesis intends to check the spelling for Animals and Plants, and add correct Myanmar words to the Dictionary. Each Myanmar input word is compared against a dictionary of correctly spelt Myanmar words. This system improves the quality of suggestions for missed spelt Myanmar words. en_US
dc.language.iso en en_US
dc.publisher Fifth Local Conference on Parallel and Soft Computing en_US
dc.title Myanmar Words Spelling Checking 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