Damerau–Levenshtein distance
id:
damerau-levenshtein-distance-273-13703075
title:
Damerau–Levenshtein distance
text:
In information theory and computer science, the Damerau–Levenshtein distance 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 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 operation
brand slug:
wiki
category slug:
encyclopedia
description:
Metric in computer science
original url:
https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance
date created:
date modified:
2024-02-21T20:30:45Z
main entity:
{"identifier":"Q2657425","url":"https://www.wikidata.org/entity/Q2657425"}
image:
fields total:
13
integrity:
14