Click here to Skip to main content
12,760,678 members (33,228 online)
Click here to Skip to main content

Stats

123.1K views
4.7K downloads
74 bookmarked
Posted 22 Mar 2006

Fast, memory efficient Levenshtein algorithm

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

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) SEB bank
Sweden Sweden
I work as a developer in the 'Risk control' department at SEB bank in Stockholm,Sweden and I have been designing software since the early 80's.

You may also be interested in...

Pro
Permalink | Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.170217.1 | Last Updated 26 Mar 2012
Article Copyright 2006 by Sten Hjelmqvist
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid