Fig 1.
An example of the Levenshtein distance matrix for input sequence “ccatese” and pattern “catch” (a) operators (b) Levenshtein distance matrix.
Fig 2.
Example of generalized edit distance matrix for input sequence “ccatese” and pattern “catch”.
Fig 3.
Overhead ratios of conditional statements according to computational overhead for performing operations.
Fig 4.
Step calculations in edit distance matrix; (a) vertical traversals: (b) diagonal traversals.
Fig 5.
An example of proposed method using pruning register.
Table 1.
Features of evaluated edit distance metrics.
Fig 6.
Average execution times of the Levenshtein distance metric.
Fig 7.
Average execution times of the generalized edit distance metric using similarity in shapes.
Fig 8.
Average execution times for the generalized edit distance metric using keyboard character positions.
Fig 9.
Ratios of skipped edit distance calculations.
Table 2.
Statistical analysis using a regression approach according to the edit distance metric.