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
pdf-xchange
google-chrome-console
python-idle
fileupdate
arangodb-graph
rdbms
kaleido
amazon-sns
bfcache
core-audio
fromfile
oledbdataadapter
dynamic-typing
cross-origin-read-blocking
roottools
conditional-statements
django-debug-toolbar
transformable
aws-codeartifact
avspeechsynthesizer
jwe
wpf-positioning
icloud-drive
polylineoptions
neo4j-embedded
tablesaw
mvw
entry-point
mysqlnd
jcache