The existing RSCM of the wordê i is the sum of the ranks of MT outputs in an N-best list containing the wordê i in a position that is aligned to i in the Levenshtein alignment, which is normalized by the total rank sum: is the Kronecker function, that is, if words/morphemes x and y are the same, δ(x, y) = 1; otherwise, δ(x, y) = 0.
only in the case whereê i and L i (ê I 1 , w In 1 ) are the same, the rank of the MT output w In 1 , N − n, is summed.