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
constraint-kinds
sna
webcrypto-api
cvpixelbuffer
synthea
devops-insights
tail-call-optimization
sqlite-browser
face-recognition
visual-c++-2010
android-window
b-tree
jsr380
winmd
external-data-source
google-url-shortener
aspose-slides
r-pacs
nelmio-alice
footnotes
apl
chainlink
visual-studio-test-runner
google-chrome-os
ng-image-compress
spectra
avro-tools
tedgebrowser
awilix
webintents