Enhanced Levenshtein Edit Distance Method functioning as a String-to-String Similarity Measure

• Main Authors: Abbas Al-Bakry, Marwa Al-Rikaby
• Format: Article
• Language: Arabic
• Published: University of Information Technology and Communications 2016-12-01
• Series: Iraqi Journal for Computers and Informatics
• Subjects: minimum edit distance, similarity, levenshtein method, damerau's errors types.
• Online Access: http://ijci.uoitc.edu.iq/index.php/ijci/article/view/83
• ISSN: 2313-190X; 2520-4912

Levenshtein is a Minimum Edit Distance method; it is usually used in spell checking applications for generating candidates. The method computes the number of the required edit operations to transform one string to another and it can recognize three types of edit operations: deletion, insertion, and substitution of one letter. Damerau modified the Levenshtein method to consider another type of edit operations, the transposition of two adjacent letters, in addition to the considered three types. However, the modification suffers from the time complexity which was added to the original quadratic time complexity of the original method. In this paper, we proposed a modification for the original Levenshtein to consider the same four types using very small number of matching operations which resulted in a shorter execution time and a similarity measure is also achieved to exploit the resulted distance from any Edit Distance method for finding the amount of similarity between two given strings.