In the last few years, so called morphology, in general, and two-level morphology in particular, have become widely accepted as paradigms for the computational treatment of morphology. Finite-state morphology appeals to the notion of a finite-state transducer, which is simply a classical finite-state automaton whose transitions are labeled with pairs, rather than with single symbols. The automaton operates on a pair of tapes and advances over a given transition if the current symbols on the tapes match the pair on the transition. .
