Glossary: Algorithms Beyond the Basics in Go
Edit distance
The fewest single-letter changes (insertions, deletions or replacements) needed to turn one word into another. It is a classic dynamic programming problem solved with a 2D table.
Glossary: Algorithms Beyond the Basics in Go
The fewest single-letter changes (insertions, deletions or replacements) needed to turn one word into another. It is a classic dynamic programming problem solved with a 2D table.