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
recursivetask
acrobat-sdk
marklogic-8
mainactor
gradlew
onesignal
project-reference
qgraphicsview
google-app-engine-go
netapi32
font-smoothing
nzsql
remarkjs
odroid
premailer
fault
es5-shim
multiple-processes
subfigure
ordereddict
stubbydb
fastlane-match
mappedby
poppler
auto-generate
suptitle
django-1.5
railsapps
elmo
automationpeer