More liberal decoder input

[noughtmare]

I would like to use this tool for puzzles that provide their ciphertext in non-standard formats, for example there might be a code like this:

00002020100201002111

This can be decoded by converting to Morse code using the rules 0 -> ., 1 -> -, and 2 -> (space):

.... . .-.. .-.. ---

Which then decodes to:

HELLO

Of course this needs to be very robust, for example the input could be encoded with another alphabet:

aaaacacabaacabaacbbb

To implement this, I'm thinking of an adapter that tries to find a mono-alphabetic substitution to map the input alphabet onto the regular Morse code alphabet. It should first check if the input contains less than 5 different types of symbols (dots, dashes, character separator, word separator, line separator) and then try all possible mappings. Trying all possible mappings should not be very hard because only the dots and dashes are relatively difficult to distinguish, all the separators should be easy to spot because they are increasingly far apart.

And I think this should not be limited to just the Morse code decoder, but many of the other similar ciphers.

Would it be possible to implement something like this in Ares?