Update for 04-05-22 18:45
This commit is contained in:
parent
4057eed1aa
commit
ad24ae42dc
BIN
Ideas.md.gpg
BIN
Ideas.md.gpg
Binary file not shown.
13
tech/Damerau-Levenshtein.wiki
Normal file
13
tech/Damerau-Levenshtein.wiki
Normal file
@ -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.
|
@ -38,6 +38,10 @@ Different ways to store and operate on data, with differing efficiency
|
|||||||
* [[DFS]]
|
* [[DFS]]
|
||||||
* [[Dijkstra]]
|
* [[Dijkstra]]
|
||||||
|
|
||||||
|
=== Strings ===
|
||||||
|
|
||||||
|
* [[Damerau-Levenshtein]]
|
||||||
|
|
||||||
== Sorting ==
|
== Sorting ==
|
||||||
|
|
||||||
* [[quicksort|Quicksort]]
|
* [[quicksort|Quicksort]]
|
||||||
|
Loading…
Reference in New Issue
Block a user