Mapping between Currier A and B

[MarcoP]

Hi Marco,

I am wondering. Is the choice of the substitution to be tested something that is a user input, or is this decided (in your setup) by an algorithm?

In a one-pass approach, as you did before, this can be user input, but if it has to be iterative or progressive, this will not really be possible anymore. It significantly changes the entire approach...

Hi Rene,
my first experiments already used an algorithm to propose candidate substitutions: this was extremely simple - all the combinations of the the most common 100 sequences from each text where tried, selecting the most effective ones. 
Of course, here I will have to think of something both more extensive (the top 100 sequences might not include all relevant possibilities) and more flexible (so that iterations can alter the current best set, as described by Nablator). I think that possibly transforming B into A might be somehow easier, since it is more tolerable for B words to disappear in a mapping to A than vice-versa (the problem with or->edy mentioned by Nablator).
As I said, I understand how difficult the task is and I don't expect to obtain any miracle, but maybe we can spot something of interest even with relatively simple experiments.