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
gd
raspbian
stone-webviewer
transport-layer-protocol
office-dialog-api
qtpy
formwizard
phoenix
ngx-gallery
system-verilog
prom-client
bmi
prvalue
oozie
system.drawing.graphics
azure-vm-scale-set
gojs
downshift
amazon-transcribe
rdlc
ansible-role
blackjack
reactive-streams
voluptuous
bootstrap-rtl
object-persistence
max-age
win64
image-flutter
moa