Problemadvanced
Tree edit distance
Also called Tai distance.
Minimum cost of node insertions, deletions and relabelings turning one ordered tree into another.
Minimum cost of node insertions, deletions and relabelings turning one ordered tree 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 BWXJXN Edit this page History Report an error