12. A translator as recited in claim 1 having adaptability to voice synthesizer pre-programmed memory with unlimited word capacity in accordance with the formula T=N.sup.x -1 wherein: T=Number of words N=Number of steps x=Number of channels, whereby word capacity is increased by increasing the number of data channels and by increasing the number of steps per channel.
12. A translator as recited in claim 1 having adaptability to voice synthesizer pre-programmed memory with unlimited word capacity in accordance with the formula T=N.sup.x -1 wherein: T=Number of words N=Number of steps x=Number of channels, whereby word capacity is increased by increasing the number of data channels and by increasing the number of steps per channel. 13. A translator as recited in claim 12, including a standard code-word system for translating the channel step method into the English language, similar to the Morse Code, for letters, including the words: ARE, O,K, I, AM, WE, SEE, YES, PEE, YOU, EGGS and AND.