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
build-tools
video-game-consoles
lumen
angular-structural-directive
kaldi
google-play-protect
xquery-sql
updateview
django-commands
kubeadm
laravel-spark
ixwebsocket
temporal-difference
nlm
tabula
chararray
intellij-15
long-filenames
partiallinktext
array-difference
pcre2
azure-billing
bulk
android-checkbox
leiningen
myisam
google-cloud-dataflow
icloud-documents
grapecity
functionfs