Sequential Edit DistANce
Performs a Levenshtein distance-like algorithm on some schema to identify the minimum number of single edits (insertions, deletions, or substitutions) needed to change one schema into another.
-
Notifications
You must be signed in to change notification settings - Fork 0
Sequential Edit DistANce
License
AParise1217/Sedan
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Sequential Edit DistANce
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published