**Edit distance**is a measure of the similarity of two strings based on a count of the minimum number of operations required to transform one string to another. It has applications such as correcting misspelled words in human input or comparing DNA sequences that are viewed as strings of the letters A, C, G and T.

## Metrics

Metrics for edit distance differ in terms of the operations they allow. The most common metric, known as Levenshtein distance, allows deletion, insertion and substitution.Overview: Edit Distance | ||

Type | Algorithms | |

Definition | A measure of the similarity of two strings based on a count of the minimum number of operations required to transform one string to another. | |

Related Concepts | AlgorithmsFault ToleranceError ToleranceSearchComputing |