Implement a modified version of Levenshtein distance algorithm (https://en.wikipedia.org/wiki/Levenshtein_distance) to compute how we should transition from one string to the next. This algorithm will allow us to make the minimum number of column changes for when the length of the text changes.
A side effect of this behavior is it will preserve the common elements in the string, e.g. for currency formats animating from $1234.55 to $234.76 will be much smoother.
Implement a modified version of Levenshtein distance algorithm (https://en.wikipedia.org/wiki/Levenshtein_distance) to compute how we should transition from one string to the next. This algorithm will allow us to make the minimum number of column changes for when the length of the text changes.
A side effect of this behavior is it will preserve the common elements in the string, e.g. for currency formats animating from $1234.55 to $234.76 will be much smoother.