But typical OT grammars offer much richer finite-state models of left context ( Eisner 1997a ) than provided by the traditional HMM finite-state topologies .
efficient generation in primitive optimality theory
Jason Eisner
Just like OT grammars , HMM Viterbi decoders are functions that pick the optimal output from E * , based on criteria of well-formedness ( transition probabilities ) and faithfulness to the input ( emission probabilities ) . But typical OT grammars offer much richer finite-state models of left context ( Eisner 1997a ) than provided by the traditional HMM finite-state topologies . Now , among methods that use a Gibbs distribution to choose among linguistic forms , OT generation is special in that the distribution ranks the features strictly , rather than weighting them in a gentler way that allows tradeoffs .
But typical OT grammars offer much richer finite-state models of left context ( @@CITATIONa ) than provided by the traditional HMM finite-state topologies .