{"created":"2020-09-01T15:35:01.265164+00:00","id":4963,"links":{},"metadata":{"_buckets":{"deposit":"37e088e7-701a-454b-b781-a010cf32a7eb"},"_deposit":{"id":"4963","owners":[],"pid":{"revision_id":0,"type":"recid","value":"4963"},"status":"published"},"_oai":{"id":"oai:meral.edu.mm:recid/4963","sets":["1582963302567:1597824273898"]},"communities":["ucsy"],"item_1583103067471":{"attribute_name":"Title","attribute_value_mlt":[{"subitem_1551255647225":"Myanmar Words Spelling Checking Using Levenshtein Distance Algorithm","subitem_1551255648112":"en"}]},"item_1583103085720":{"attribute_name":"Description","attribute_value_mlt":[{"interim":"Natural Language Processing (NLP) is oneof the most important research area carried out inthe world of Artificial Intelligence (AI). SpellingChecking, Machine Translation, Automatic TextSummarization, Information Extraction andAutomatic Text Categorization Information Retrievalare included in NLP. A Myanmar Spelling Checker isan essential component of many of the commondesktop applications such word processors as well asthe more exotic applications. In this system, itproposes the process of checking the spelling of aMyanmar input word and suggestion list if it ismisspelled Myanmar word. This system is intended todevelop a Myanmar Language Spell Checker (orspell check) by using Levenshtein DistanceAlgorithm. Moreover, Dynamic Threshold Algorithmand Transformation Algorithm are used in MyanmarSpelling Checking. This system uses ZawgyiMyanmar Font and implements using Java Languageand MySQL Server. This thesis intends to check thespelling for Animals and Plants, and add correctMyanmar words to the Dictionary. Each Myanmarinput word is compared against a dictionary ofcorrectly spelt Myanmar words. This systemimproves the quality of suggestions for missed speltMyanmar words."}]},"item_1583103108160":{"attribute_name":"Keywords","attribute_value":[]},"item_1583103120197":{"attribute_name":"Files","attribute_type":"file","attribute_value_mlt":[{"accessrole":"open_access","date":[{"dateType":"Available","dateValue":"2019-07-12"}],"displaytype":"preview","filename":"psc2010paper (135).pdf","filesize":[{"value":"408 Kb"}],"format":"application/pdf","licensetype":"license_note","mimetype":"application/pdf","url":{"url":"https://meral.edu.mm/record/4963/files/psc2010paper (135).pdf"},"version_id":"414a47cd-981a-4b2b-9a69-d1b00ce7d964"}]},"item_1583103131163":{"attribute_name":"Journal articles","attribute_value_mlt":[{"subitem_issue":"","subitem_journal_title":"Fifth Local Conference on Parallel and Soft Computing","subitem_pages":"","subitem_volume":""}]},"item_1583103147082":{"attribute_name":"Conference papers","attribute_value_mlt":[{"subitem_acronym":"","subitem_c_date":"","subitem_conference_title":"","subitem_part":"","subitem_place":"","subitem_session":"","subitem_website":""}]},"item_1583103211336":{"attribute_name":"Books/reports/chapters","attribute_value_mlt":[{"subitem_book_title":"","subitem_isbn":"","subitem_pages":"","subitem_place":"","subitem_publisher":""}]},"item_1583103233624":{"attribute_name":"Thesis/dissertations","attribute_value_mlt":[{"subitem_awarding_university":"","subitem_supervisor(s)":[{"subitem_supervisor":""}]}]},"item_1583105942107":{"attribute_name":"Authors","attribute_value_mlt":[{"subitem_authors":[{"subitem_authors_fullname":"Oo, Nwe Zin"},{"subitem_authors_fullname":"Htwe, Tin Myat"}]}]},"item_1583108359239":{"attribute_name":"Upload type","attribute_value_mlt":[{"interim":"Publication"}]},"item_1583108428133":{"attribute_name":"Publication type","attribute_value_mlt":[{"interim":"Article"}]},"item_1583159729339":{"attribute_name":"Publication date","attribute_value":"2010-12-16"},"item_1583159847033":{"attribute_name":"Identifier","attribute_value":"http://onlineresource.ucsy.edu.mm/handle/123456789/861"},"item_title":"Myanmar Words Spelling Checking Using Levenshtein Distance Algorithm","item_type_id":"21","owner":"1","path":["1597824273898"],"publish_date":"2019-07-12","publish_status":"0","recid":"4963","relation_version_is_last":true,"title":["Myanmar Words Spelling Checking Using Levenshtein Distance Algorithm"],"weko_creator_id":"1","weko_shared_id":-1},"updated":"2021-12-13T02:40:16.634533+00:00"}