UCSY's Research Repository

Comparison of Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm for String Matching

Show simple item record

dc.contributor.author Aung, Khin Moe Myint
dc.contributor.author Htwe, Ah Nge
dc.date.accessioned 2019-10-15T17:20:25Z
dc.date.available 2019-10-15T17:20:25Z
dc.date.issued 2019-03
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/2319
dc.description.abstract String similarity measures play an increasingly important role in text related research and applications in tasks and operate on string sequences and character composition. A string metric is a metric that String_Based measures similarity or dissimilarity (distance) between two strings for approximate string matching or comparison. Determining similarity between texts is crucial to many applications such as clustering, duplicate removal, merging similar topics or themes, text retrieval and etc. Among many methods of String similarity, Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm are used in this proposed system. The proposed system intended to present by comparing Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm based on their f-score. So, user can search effectively the required song by typing the title of songs or artist name using English language in this proposed system. Then the proposed system retrieve the user’s required song information with similarity score. The matching efficiencies of these algorithms are compared by searching f-score and execution time. The proposed system uses song title and artist feature of billboard song dataset from year 1965- 2015 and implements using Java programming language. en_US
dc.language.iso en_US en_US
dc.publisher National Journal of Parallel and Soft Computing en_US
dc.relation.ispartofseries Vol-1, Issue-1;
dc.subject Levenshtein Distance Algorithm en_US
dc.subject Needleman-Wunsch Distance Algorithm en_US
dc.subject Dataset en_US
dc.subject Similarity Score en_US
dc.subject f-score en_US
dc.title Comparison of Levenshtein Distance Algorithm and Needleman-Wunsch Distance Algorithm for String Matching 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