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
invitation
astoria
cloneable
selectnodes
orthogonal
flutter-3.0
onigmo
python-mock
adtf
gdbserver
google-analytics-v3
web-optimization
flush
grails-orm
named-query
canny-operator
xtratreelist
voronoi
ansi-sql-92
chrome-declarativenetrequest
webos
laravel-6
vuze
user-testing
protobuf-3
postgres-xl
gedmo-tree
uicolorpickerviewcontroller
elasticsearch-alias
nsmutabledictionary
