Skip to Main Content
Adebayo's Demonstration of The Levenshtein Algorithm
Home
Dashboard
Master Detail
Compare By List
Funnel Report
Area Chart
This Is A Demo of The Shortest Distance Algorithm
This is only a Use Case & Thank you for stopping by.
Welcome to Adebayo's App For Names Comparison
"Levenshtein distance (or edit distance) between two strings is the number of deletions, insertions, or substitutions required
to transform a source string into another target string. For example, if the source string is "book" and the target string is "back,"
to transform "book" to "back," you will need to change first "o" to "a," second "o" to "c," without additional deletions and insertions.
Thus, the Levenshtein distance between "book" and "back" will be 2." - Text Source: planetcalc.com
This Offering Might Be Important For The Following Categories:
* Individual(s).
* Organisation(s).
* Not For Profits/Charities.
* Or Any One
With A Need To Protect Valued Interest Or Asset(s).
Twitter
LinkedIn
Facebook
YouTube
apex.oracle.com
Oracle APEX Community
Discussion Forums
Autonomous Database + APEX