L2 vocabulary acquisition, knowledge and use

A commonly-used bottom-up dynamic programming algorithm for computing the
Levenshtein distance involves the use of an (n + 1)(m+1) matrix, where n and m
are the lengths of the two strings. Figure 1 illustrates the matrix. The two ...