This repo contains a C++ code implementing methods to compute the Levenstein (Damerau) Distance between 2 words.
The key approach is dynamic programming approach.
One particularly interesting implementation is based on recursivity with memoization.
-
Notifications
You must be signed in to change notification settings - Fork 0
dhia680/levenstein_dist.cpp
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Various implementations in C++ of (Damerau) Levenstein edition distance.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published