incom.py allows computing LD(w i , w j ) based on a user-defined cost matrix M, which contains the complete alphabets A(L 1 ), A(L 2 ) of two languages L 1 , L 2 as rows and columns, respectively, as well as the costs for every possible character substitution.
for two characters s ∈ A(L 1 ) and t ∈ A(L 2 ), M(s, t) is the cost of substituting s by t. This user defined cost matrix allows computing linguistically motivated alignments by incorporating a linguistic prior into the computation of the Levenshtein distance.