Jump to content

[CR] Strings Levenshtein Distance

Recommended Posts


Name: Strings Levenshtein Distance

Submitter: LAVA 1.0 Content

Submitted: 03 Jul 2009

File Updated: 03 Jul 2009

Category: General

LabVIEW Version: 8.5

Version: 1.0.0

License Type: GNU Public

Potentially make this available on the VI Package Network?: Yes

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.

Click here to download this file

Link to post
Share on other sites
  • 1 year later...

Join the conversation

You can post now and register later. If you have an account, sign in now to post with your account.

Reply to this topic...

×   Pasted as rich text.   Paste as plain text instead

  Only 75 emoji are allowed.

×   Your link has been automatically embedded.   Display as a link instead

×   Your previous content has been restored.   Clear editor

×   You cannot paste images directly. Upload or insert images from URL.

  • Create New...

Important Information

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