Click here to Skip to main content
13,249,504 members (36,331 online)
Click here to Skip to main content

Stats

41K views
576 downloads
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

Revisions


  

Compare Revision Minor Date Status Editor
1 - publicly available No 29-Apr-05 4:55 Available Nish Nishant

License

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

Share

About the Author

Andreas Muegge
Web Developer
Germany Germany
No Biography provided

You may also be interested in...

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