Click here to Skip to main content
11,487,979 members (75,472 online)
Click here to Skip to main content

Tolerant string matching using the Levenshtein algorithm

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


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

No alternatives have been posted.


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

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