Tmbox

The edit distance between the words is infinite, so your score for the test case is n-inf = -inf. Only positive scores are included in the total.

How can there be programs written in Java and C++ for this problem ???

those programs write the set of rules to standard output

They do not "do the actual work", but simply spit out the rules in language defined in problem's description.

For example, sample program in Perl could be:

print <<EOF
000 dada 000 dada da
000 umda 000 dada da
000 shsh 000 shsh da
000 didi 001 didi di
001 dada 002 didi di
EOF

However, nothing is passed to such program's input and it's just another (possibly more convinient?) way besides passing the rules in problem's language as program in "TEXT" language.

Apart from it being a little more convenient, it is also the only way of submitting an enormous Turing Machine. A quick calculation will tell you that a program consisting of all the possible rules takes up about 320kB.

Thanks to all for your replies !
Of course, I had thought about a program to generate the rules (my current best entry is completely hand-written 8) ), but I didn't think about actually submitting that program directly instead of the rules.