We model the evolution of a word w to its child w as a sequence of unigram edits that include insertions, deletions, and substitutions.
we use a standard three-state pair hidden Markov model that is closely related to the classic alignment algorithm of Needleman and Wunsch (1970) (Durbin et al., 2006).