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
nested-lists
formarray
identifiable
fantom
node-pre-gyp
document
laravel-service-container
appcelerator-titanium
fieldeditor
ants
slim-lang
aws-data-pipeline
crate
apache-commons-fileupload
findinfiles
e
loess
makensis
aws-ebs
salib
docx2pdf
mpj-express
machinekey
derivative
vetur
jquery-bar-rating
lpeg
constructor-inheritance
bcrypt.net
authlib