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
ibm-case-manager
react-native-udp
pitch-shifting
angular4
lua-resty-openidc
sicstus-prolog
pdf-to-html
jung
access-rights
cookiebot
laravel-filters
pepper
ftp
k3s
palantir-foundry-security
wiktionary
iso9660
dojox.grid
sonarscanner
live-tracking
webvtt
xvfb
apiary.io
market-basket-analysis
fanotify
blue-green-deployment
prologue
androiddesignsupport
pdfium
backtrace