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
binutils
dvb
html-encode
azure-cosmosdb
jsonparser
worksheet
java-melody
topojson
scriptaculous
fckeditor
sproutcore
tikz
mystic
ocfs2
libtool-xcode
directory-walk
qstylesheet
getelementbyid
yii2-validation
maml
system-tray
signalr
android-billing
openstack-designate
hidden-field
animation
google-meet
wcf
radians
downshift