Computer scienceAlgorithms and Data StructuresAlgorithmsString algorithmsString similarity

Levenshtein distance

Right definition

Report a typo

Find the proper ending for the Levenshtein distance definition!

For two strings $a$ and $b$ the Levenshtein distance defines ... (select the correct definition):

Select one option from the list

... the minimal number of insertions, deletions, or substitutions required to transform

a

into

b

... the minimal number of substitutions required to transform

a

into

b

... the maximal number of matching symbols of

a

and

b

... the minimal number of inversions and substitutions required to transform

a

into

b

___

Create a free account to access the full topic