One section of the paper describes which algorithms the programers used. It appears that the solutions in scripting languages made heavy use of associative arrays, so the results might change if you swapped Tcl's hashing algorithm for Perl's.

The algorithms described don't seem very clever. I expect you could do much better by splitting the input number into digraphs or trigraphs, sorting those by frequency in the dictionary, and matching the rarest ones first.