Update for 04-05-22 18:45

tech/Damerau-Levenshtein.wiki

@@ -0,0 +1,13 @@
+= Damerau-Levenshtein =
+
+Damerau-Levenshtein distance is a metric measuring the edit distance between
+two strings. It provides the minimum number of operations required to transform
+one string to another, via
+
+* insertion
+* deletion
+* substitution
+* transposition
+
+Many algorithms prefer to ignore the transpositons aspect of this problem, as
+it adds signgficant complexity.

tech/algorithms.wiki

@@ -38,6 +38,10 @@ Different ways to store and operate on data, with differing efficiency
 * [[DFS]]
 * [[Dijkstra]]
 
+=== Strings ===
+
+* [[Damerau-Levenshtein]]
+
 == Sorting ==
 
 * [[quicksort|Quicksort]]