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
apache-atlas
android-app-links
front-end-optimization
sql-agent
hssfworkbook
nstask
frama-c
react-phone-number-input
jersey
gns3
jgoodies
annoy
group
rce
ssl-client-authentication
phasset
chart.jsv3
amazon-lex
lightmode
webproject
files-app
rebase
runtime-environment
amcharts4
doctype
vyper
influxdb
sa-mp
gitlab-8
nsinputstream