Finally, we compute the error-correction probability between two strings from the total number of edits required to transform the candidate translation into the reference translation.
we define the error-correction distribution in Equation 11as: where k = Lev(p, t a ) is the character-level Levenshtein distance between the user defined prefix p and the prefix t a of the hypothesized translation t defined by alignment a.