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
network-drive
knyle-style-sheet
cgbitmapcontext
multiple-value
google-people-api
skinning
swi-prolog
sdl
powerpoint-web-addins
medium-trust
android-6.0-marshmallow
android-hardware
phpdoc
css-position
swift-optionals
beegfs
validating
xml-signature
hard-delete
geostatistics
communicate
jdo
zarith
python-sh
cognos-11
s4hana
bounded-wildcard
dynamicpdf
memory-profiling
function-object
