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
serverless-architecture
elevatezoom
ilspy
pynotify
quantmod
uri-fragment
command-query-separation
sourcetree
leaderboard
non-english
componentlistener
exclude-constraint
cartodb
gamlss
storage-engines
notificationlistenerservice
power-law
redmine-plugins
android-navigationview
google-sites
xmlnode
nsviewcontroller
path-parameter
unqork
doctrine-odm
remote-containers
diffie-hellman
embedded-video
intake
recharts
