We construct a string z by prepending lev(x, y) many <mcorr> tokens to y, and construct I such that: We adapt the notation of Mohri (2003) and denote the cost I assigns to mapping a string z to itself as [[I]](z), and set [[I]](z) = ∞ if I does not accept z. SMT(y|x) is the SMT score.
i represents the weighted SMT n-best list after adding lev(x, y) many <mcorr> tokens to each hypothesis as illustrated in Fig.