Metraipolis › archive › dc_00ee1d166286

Damerau–Levenshtein distance — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T22:11:31.592Z
SHA-256 of the archived text
7e2f53610eb1b9505a591dd867727a2391c71105a09455f4f831c2282d23daff
Stable URL of this page
https://metraipolis.com/documento/dc_00ee1d166286

How to cite

Damerau–Levenshtein distance — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_00ee1d166286 (Metraipolis archive dc_00ee1d166286, sha256 7e2f53610eb1b9505a591dd867727a2391c71105a09455f4f831c2282d23daff)
BibTeX
@misc{dc00ee1d166286,
  title = {Damerau–Levenshtein distance — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_00ee1d166286; sha256 7e2f53610eb1b9505a591dd867727a2391c71105a09455f4f831c2282d23daff},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In information theory and computer science, the Damerau–Levenshtein distance (named after Frederick J. Damerau and Vladimir I. Levenshtein) is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one word into the other. The Damerau–Levenshtein distance differs from the classical Levenshtein distance by including transpositions among its allowable operations in addition to the three classical single-character edit operations (insertions, deletions and substitutions). In his seminal paper, Damerau stated that in an investigation of spelling errors for an information-retrieval system, more than 80% were a result of a single error of one of the four types. Damerau's paper considered only misspellings that could be corrected with at most one edit operation. While the original motivation was to measure distance between human misspellings to improve applications such as spell checkers, Damerau–Levenshtein distance has also seen uses in biology to measure the variation between protein sequences.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «information retrieval»).
Fonte: Wikipedia in inglese, voce «Damerau–Levenshtein distance» — https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance
Wikidata Q2657425 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q2657425
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1369217619, consultata il 2026-10-07T21:49:53.564Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 4d5fbad8d9c38ea08d94b8cff4cdce88929f7f4876ff7de651b940cfbf5b8f4b