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
adview
nsprogress
poller
google-natural-language
helidon
erase
java-native-library
lasagne
goto
yaws
shinymodules
voting
skewness
waterline
ib-api
layout
identityserver3
chrome-app-developer-tool
loguru
osmesa
dbt
docker-maven-plugin
lower-bound
async-ctp
redirect
read-eval-print-loop
api-linkpreview
script-tag
nuttx
jetpack-compose-animation