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
inputmismatchexception
vim-airline
libvpx
http-status-code-308
copy-protection
astropy
border
mod-headers
azure-log-analytics-workspace
archive
database-scripts
bing-api
categorical-data
soti
video-ads
azure-machine-learning-studio
script
relative-addressing
controlvalueaccessor
unpkg
coda-slider
mercurial
react-scrollmagic
jotai
6lowpan
contention
http-compression
schematron
java-7
dnode