web
You’re offline. This is a read only version of the page.
close
Skip to main content

Notifications

Announcements

Community site session details

Community site session details

Session Id :

Calculate Levenshtein Distance

 Profile Picture Posted by Community member

This flow is a replication of the Levenshtein Distance algorithm to calculate string similarity (number of steps required to make two strings same). The flow is a manual trigger based and accepts two string inputs (this can however be integrated with any other flow and the strings can be passed dynamically)

Categories:

Comments

  • FB-12110808-0 Profile Picture FB-12110808-0
    Posted at
    Calculate Levenshtein Distance
    Hello,

    I’d be very interested in getting this flow, but unfortunately time has passed and the link to the attachments no longer works...

    I know my chances of getting a reply are almost zero, but I’ll try anyway:
    @jchris207, would you have any way to re-post or extract this algorithm?

    Thanks a lot!
  • jchris207 Profile Picture jchris207 34
    Posted at
    Calculate Levenshtein Distance

    Thank you for this, this saves me a lot of time, this is awesome and I greatly appreciate you posting this. I will give this a shot on my current project and hope it is still functional 2.5 years after this post! 😄