Click here to Skip to main content
12,817,318 members (34,274 online)
Click here to Skip to main content


19 bookmarked
Posted 29 Apr 2005

Tolerant string matching using the Levenshtein algorithm

, 29 Apr 2005
A practical example how to use the Levenshtein algorithm for string matching

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.


This article has no explicit license attached to it but may contain usage terms in the article text or the download files themselves. If in doubt please contact the author via the discussion board below.

A list of licenses authors might use can be found here


About the Author

Andreas Muegge
Web Developer
Germany Germany
No Biography provided

You may also be interested in...

Permalink | Advertise | Privacy | Terms of Use | Mobile
Web02 | 2.8.170308.1 | Last Updated 29 Apr 2005
Article Copyright 2005 by Andreas Muegge
Everything else Copyright © CodeProject, 1999-2017
Layout: fixed | fluid