Click here to Skip to main content
Click here to Skip to main content
Add your own
alternative version
Go to top

Fast, memory efficient Levenshtein algorithm

, 26 Mar 2012
A version of the Levenshtein algorithm that uses 2*Min(StrLen1,StrLen2) bytes instead of StrLen1*StrLen2 bytes.
levenshtein_src.zip

By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.

If a file you wish to view isn't highlighted, and is a text file (not binary), please let us know and we'll add colourisation support for it.

License

This article, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Share

About the Author

Sten Hjelmqvist
Software Developer (Senior) Affecto Sweden AB
Sweden Sweden
I'm a computer consultant at Affecto AB in Stockholm,Sweden and I have been designing software since the early 80's.

| Advertise | Privacy | Mobile
Web01 | 2.8.140916.1 | Last Updated 26 Mar 2012
Article Copyright 2006 by Sten Hjelmqvist
Everything else Copyright © CodeProject, 1999-2014
Terms of Service
Layout: fixed | fluid