Click here to Skip to main content
11,706,142 members (43,616 online)
Click here to Skip to main content
Add your own
alternative version

Fast, memory efficient Levenshtein algorithm

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

Revisions


  

Compare Revision Minor Date Status Editor
4 - publicly available No 6-Jul-15 9:42 Available Sean Ewington
Initial creation
3 No 6-Jul-15 3:02 Pending Sten Hjelmqvist
The reference was updated
2 No 26-Mar-12 7:59 Available Sten Hjelmqvist
1 No 27-Mar-06 4:17 Available Rinish Biju

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) SQL Service AB
Sweden Sweden
I'm a computer consultant at 'SQL Service AB' , in Stockholm,Sweden and I have been designing software since the early 80's.

You may also be interested in...

| Advertise | Privacy | Terms of Use | Mobile
Web03 | 2.8.150819.1 | Last Updated 26 Mar 2012
Article Copyright 2006 by Sten Hjelmqvist
Everything else Copyright © CodeProject, 1999-2015
Layout: fixed | fluid