Click here to Skip to main content
12,621,492 members (33,210 online)
Click here to Skip to main content
Alternatives (1)
Add your own
alternative version

Stats

119.7K views
4.6K downloads
74 bookmarked
Posted

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.

Alternatives

Members may post updates or alternatives to this current article in order to show different approaches or add new features.

29 Jun 2012
Horatiu-Andrei Stoianovici
This is an alternative for "Fast, memory efficient Levenshtein algorithm"

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.

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