We normalize MCLCS z and call it normalized We take the weighted sum of these individual values v 1 , v 2 , v 3 , and v 4 to determine string similarity score, where α 1 , α 2 , α 3 , α 4 are weights and α 1 + α 2 + α 3 + α 4 = 1.
the similarity of the two strings, S ∈ [0, 1] is: We heuristically set equal weights for our ex- To give an example, consider s i = albastru and The string similarity, We determine the normalized frequency value of each candidate word for a single position with respect to all other candidates for the same position.