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
nimble-nim
android-actionbaractivity
.mov
border-image
memoji
assignment-problem
sum
interstitial
gitweb
ckshare
flurry-analytics
acoustic-telemetry
minidump
python-sounddevice
pox
bitcoin
coldfusion-10
sharpdevelop
unsafemutablebufferpointer
winrt-xaml
lmfit
assertion
ex
soundfile
xcode9.3-beta
olap-cube
google-wave
short-circuit-evaluation
rdf4j
opcode