Given 2 strings s and t. I need to find for each substring in s edit distance(Levenshtein distance) to t. Actually I need to know for each i position in s what
tcp-ip
orientdb
hydra
regularized
constraintlayout-helper-widget-flow
indexoutofrangeexception
lossy-compression
thin
cpuset
reveal.js
distinct-values
deltaspike-jpa
background-position
nssavepanel
pandoc
exchange-basicauth
function-definition
asterisk-ari
webpackjsonp
csp-html-webpack-plugin
sampling
docusignapextoolkit
vaadin23
elasticsearch-bulk">elasticsearch-bulk
blueprism
visual-studio-app-center-distribute
wscf
debian
plantuml
smb