In information theory and computer science, the edit distance between two strings of characters generally refers to the Levenshtein distance. However, according to Nico Jacobs, “The term ‘edit distance’ is sometimes used to refer to the distance in which insertions and deletions have equal cost and replacements have twice the cost of an insertion”.
It may also refer to the whole class of string metrics that measure distance as the (weighted or unweighted) number of operations required to transform a string into another. There are several different ways to define an edit distance, depending on which edit operations are allowed: replace, delete, insert, transpose, and so on. There are algorithms to calculate its value under various definitions:
- Hamming distance
- Levenshtein distance (the most common definition, calculated by Hirschberg's algorithm or the Wagner–Fischer algorithm)
- Damerau–Levenshtein distance
- Jaro–Winkler distance
Famous quotes containing the words edit and/or distance:
“To a philosopher all news, as it is called, is gossip, and they who edit it and read it are old women over their tea.”
—Henry David Thoreau (1817–1862)
“Midway the lake we took on board two manly-looking middle-aged men.... I talked with one of them, telling him that I had come all this distance partly to see where the white pine, the Eastern stuff of which our houses are built, grew, but that on this and a previous excursion into another part of Maine I had found it a scarce tree; and I asked him where I must look for it. With a smile, he answered that he could hardly tell me.”
—Henry David Thoreau (1817–1862)