In this paper a method is presented to describe an essentially non-deterministic problem like the translation of phoneme strings into grapheme strings with a deterministic rule-system like the SPE-formalism. The solution lies in the addition of a type-3 grammar and a small post-processor. It is shown that this addition amplifies the power of the SPE-formalism.