Problemintro
Edit distance
Also called Levenshtein distance, string edit distance.
Minimum number of insertions, deletions and substitutions that turn one string into another.
Minimum number of insertions, deletions and substitutions that turn one string into another.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag Z4GVFF Edit this page History Report an error