In a typical edit distance algorithm - say Levenshtein - there are hardcoded costs for specific operations, such as insertion, substitution, and deletion. This is obviously a bad assumption (the substitution
K is small in
Kapital, while the substitution
T is high in
After some research, I've found that this problem has been tackled in past, though not on a character cost weighted level.
Can someone think of / propose a way to learn the costs for different substitutions between different character pairs? (I think it best to focus on a single transformation operation to begin with).