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
jimp
jinja2
computation-expression
react-create-app
dataservice
ethercat
rfc2445
layerdrawable
autofixture
class-names
itemwriter
fetch-api
jaeger
varcharmax
jitcode-jitcdde-jitcsde
kendo-datetimepicker
siege
distribution
calendar
preforking
window.opener
unobtrusive-ajax
unite.vim
angular-ngselect
faker.js
handheld
excel-dna
label-encoding
associated-domains
microkernel