Mapping a set of corrupted strings to the correct ones
That problem is called approximate string matching or fuzzy string searching. It has been well studied in computer science.
If there is a limited, known collection of valid strings (aka, a dictionary), then the problem can be framed as spell correction.