What is the name of the algorithms that show step changes in a word?

Question

Python

Hello, I’m solving such a problem, in short, I need a way to convert one word to another in steps, for example емтто - метто - метро. I intuitively guess that this is something from the edit distance region (Dahmerau-Levenshtein, permutation operations are also needed), but I don’t understand how to shift the matrix from there to word changes. If anyone knows how such algorithms are called, can you tell me in which direction to dig?

Answer 1

It's about graph theory and shortest paths. You need to find a path in a word graph where there are edges between words with one change.