Assignment No. 3:

(1) Consider a simple language that allows two words: yes and no.
    Develop a statistical model for spelling errors based on
    observations of the following data:

     yes, yis, yis, yas, yes, yes
     no, mo, do, mo, do, no

    This is the type of input you might see from an optical
    character recognition system.

(2) Creare a finite state transducer that implements the following
    conversions:

     aaa => zzz
     aab => zzb
     baa => bzz
     aba => zbz
     bbb => bbb
     bba => bbz
     bab => bzb

    Display the transducer as a graph. Comment on its complexity.

(3) Go to our standard SWITCHBOARD lexicon and extract 20 words
    which can be represented as 10 valid English morphemes plus
    stems. Explain the relationship of these morphemes to syllables.