Jump to content

1 Screenshot

About This File

Copyright © 2008, Leif S. Kirschenbaum

All rights reserved.


Leif S. Kirschenbaum

--see readme file for contact informaation.


This VI computes the Leventshein distance between two strings.

It is based on the pseudocode found in Wikipedia online:


"The Levenshtein distance between two strings is given by the minimum number of

operations needed to transform one string into the other, where an operation is an

insertion, deletion, or substitution of a single character."

It functions by creating a step matrix which is N+1 x M+1, where N and M are the

lengths of the two strings to be compared, and filling in each cell of this matrix

indicating how many steps (insertions, deletions, character substitutions) are required.

The total number of steps to convert one string into the other is given by the last cell

in the matrix.

Change Log:

1.0.0: Initial release of the code.

  • Create New...

Important Information

By using this site, you agree to our Terms of Use.