Our final model is the sum ofŝ and s c (i.e.,ŝ + s c ) where s c is computed by a linear combination of: • d(e i , m i ), the string similarity score between the title of e i and m i , using Levenshtein algorithm, • p wiki (e i |m i ), and .
we have: We tune α, β, γ on the development set.