{"_buckets": {"deposit": "556d6c03-7ded-4b0c-a7e1-780715ca5511"}, "_deposit": {"id": "4295", "owners": [], "pid": {"revision_id": 0, "type": "recid", "value": "4295"}, "status": "published"}, "_oai": {"id": "oai:meral.edu.mm:recid/4295", "sets": ["user-ucsy"]}, "communities": ["ucsy"], "item_1583103067471": {"attribute_name": "Title", "attribute_value_mlt": [{"subitem_1551255647225": "Comparison of Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm for String Matching", "subitem_1551255648112": "en_US"}]}, "item_1583103085720": {"attribute_name": "Description", "attribute_value_mlt": [{"interim": "String similarity measures play an increasingly important role in text relatedresearch and applications in tasks and operate on string sequences and charactercomposition. A string metric is a metric that String_Based measures similarity ordissimilarity (distance) between two strings for approximate string matching orcomparison. Determining similarity between texts is crucial to many applications suchas clustering, duplicate removal, merging similar topics or themes, text retrieval andetc.String matching algorithms are used to find the similar characters between thesource string and the target string. The proposed system is intended to match songinformation by comparing Levenshtein Distance Algorithm and Needleman-WunchDistance Algorithm based on their f-score and execution time. So, user can searcheffectively their required song information by the title of songs or artist name usingEnglish language. Then the proposed system retrieves the user’s required songinformation with similarity score. The matching efficiencies of these algorithms arecompared by searching f-score and the execution time. The proposed system usessong title and artist feature of billboard song dataset from year 1965-2015 andimplements using Java programming language."}]}, "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-09-23"}], "displaytype": "preview", "download_preview_message": "", "file_order": 0, "filename": "KhinMoeMyintAung.pdf", "filesize": [{"value": "1221 Kb"}], "format": "application/pdf", "future_date_message": "", "is_thumbnail": false, "licensetype": "license_free", "mimetype": "application/pdf", "size": 1221000.0, "url": {"url": "https://meral.edu.mm/record/4295/files/KhinMoeMyintAung.pdf"}, "version_id": "471bcbe9-cdc2-4e04-93b3-39f3c3228cac"}]}, "item_1583103131163": {"attribute_name": "Journal articles", "attribute_value_mlt": [{"subitem_issue": "", "subitem_journal_title": "", "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": "University of Computer Studies, Yangon", "subitem_supervisor(s)": [{"subitem_supervisor": ""}]}]}, "item_1583105942107": {"attribute_name": "Authors", "attribute_value_mlt": [{"subitem_authors": [{"subitem_authors_fullname": "Aung, Khin Moe Myint"}]}]}, "item_1583108359239": {"attribute_name": "Upload type", "attribute_value_mlt": [{"interim": "Publication"}]}, "item_1583108428133": {"attribute_name": "Publication type", "attribute_value_mlt": [{"interim": "Thesis"}]}, "item_1583159729339": {"attribute_name": "Publication date", "attribute_value": "2019-01"}, "item_1583159847033": {"attribute_name": "Identifier", "attribute_value": "http://onlineresource.ucsy.edu.mm/handle/123456789/2236"}, "item_title": "Comparison of Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm for String Matching", "item_type_id": "21", "owner": "1", "path": ["1597824322519"], "permalink_uri": "http://hdl.handle.net/20.500.12678/0000004295", "pubdate": {"attribute_name": "Deposited date", "attribute_value": "2019-09-23"}, "publish_date": "2019-09-23", "publish_status": "0", "recid": "4295", "relation": {}, "relation_version_is_last": true, "title": ["Comparison of Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm for String Matching"], "weko_shared_id": -1}