DamerauLevenshteinDistance
DamerauLevenshteinDistance[u,v]
gives the Damerau–Levenshtein distance between strings, vectors or biomolecular sequences u and v.
Details and Options
- DamerauLevenshteinDistance[u,v] gives the number of one-element deletions, insertions, substitutions, and transpositions required to transform u to v.
- For strings, setting the option IgnoreCase->True makes DamerauLevenshteinDistance treat lowercase and uppercase letters as equivalent.
Examples
open all close allBasic Examples (3)
Damerau–Levenshtein distance between two strings:
DamerauLevenshteinDistance["abc", "cba"]Damerau–Levenshtein distance between two vectors:
DamerauLevenshteinDistance[{1, 0, 0, 1, 1}, {0, 0, 1, 0, 1}]Damerau–Levenshtein distance between biomolecular sequences:
DamerauLevenshteinDistance[BioSequence["DNA", "CGCATAG"], BioSequence["DNA", "GCATGA"]]Scope (2)
Options (1)
Applications (2)
Cluster string data using Damerau–Levenshtein distance:
FindClusters[{"abc", "ac", "ca", "acc"}, DistanceFunction -> DamerauLevenshteinDistance]Cluster numeric data using Damerau–Levenshtein distance:
FindClusters[{{0, 1}, {1, 1}, {0, 0}, {1, 0}}, DistanceFunction -> DamerauLevenshteinDistance]Properties & Relations (4)
Damerau–Levenshtein distance counts transposition as a single operation:
DamerauLevenshteinDistance["ac", "ca"]EditDistance treats transposition as separate deletion and insertion operations:
EditDistance["ac", "ca"]Cluster string data using Damerau–Levenshtein distance:
FindClusters[{"abc", "ac", "ca", "acc"}, DistanceFunction -> DamerauLevenshteinDistance]Cluster string data using EditDistance:
FindClusters[{"abc", "ac", "ca", "acc"}, DistanceFunction -> EditDistance]DamerauLevenshteinDistance is less than or equal to HammingDistance for strings of equal length:
DamerauLevenshteinDistance["bccbbcb", "ccbbccb"]HammingDistance["bccbbcb", "ccbbccb"]DamerauLevenshteinDistance is less than or equal to HammingDistance for vectors of equal length:
DamerauLevenshteinDistance[{0, 1, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 1, 1, 0}]HammingDistance[{0, 1, 1, 0, 0, 1, 0}, {1, 1, 0, 0, 1, 1, 0}]Text
Wolfram Research (2008), DamerauLevenshteinDistance, Wolfram Language function, https://reference.wolfram.com/language/ref/DamerauLevenshteinDistance.html (updated 2020).
CMS
Wolfram Language. 2008. "DamerauLevenshteinDistance." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2020. https://reference.wolfram.com/language/ref/DamerauLevenshteinDistance.html.
APA
Wolfram Language. (2008). DamerauLevenshteinDistance. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/DamerauLevenshteinDistance.html