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

Authors

  • Abbas Al-Bakry University of Information Technology and Communications (UOITC)
  • Marwa Al-Rikaby Babylon University

DOI:

https://doi.org/10.25195/ijci.v42i1.83

Keywords:

Minimum Edit Distance, Similarity, Levenshtein method, Damerau's errors types.

Abstract

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.

Downloads

Download data is not yet available.

Author Biography

Marwa Al-Rikaby, Babylon University

College of Information Technology

Downloads

Published

2016-12-31