In order to define more complex transformations, one can consider the consecutive application of a sequence of elementary edit operations. Of special interest to the Levenshtein distance are those sequences of operations that transform one string into another. Such a sequence is known as an edit path and its length is defined as the number of operations in the sequence. The Levenshtein distance between two strings is defined as the length of the minimum length edit path, as seen in definition 2.5. Definition 2.5 (Levenshtein Distance). Let Σ be an alphabet and consider two strings s ∈ Σ n and t ∈ Σ m from Σ. An edit path from s to t is denoted by P s,t and represents a sequence of elementary edit operations that transforms s into t. Denote by |P s,t | the number of operations contained in P s,t and by P s,t the space of all edit paths from s to t. The Levenshtein distance d L (s,t) between s and t is defined as d L (s,t) = min