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
google-api-gateway
wss
url-for
image-generation
kylo
cross-reference
sling-models
skstorereviewcontroller
vaadin
dexie
entity
poly
holtwinters
mintty
pass-by-reference-value
iactivescript
stdmutex
implicits
runtime
junit-runner
connection-string
snakecasing
teamcity-9.0
scoverage
chap
webdrivermanager-java
state-monad
uimenuitem
use-strict
moving-average
