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
cmake4eclipse
webshim
nssortdescriptor
playframework
google-map-place
pivot-without-aggregate
playframework-2.3
renderscript
gpiozero
rc.d
laravel-exceptions
inkml
foundry-functions
column-sum
postgres-fdw
generative-adversarial-network
elasticsearch-hadoop">elasticsearch-hadoop
target-action
documentgroup
show
gambling
concourse-resource-types
vagrant-windows
twilio-cli
escp
xpath-2.0
react-select-plus
sharedarraybuffer
wechat-miniprogram
cpu-architecture
elasticsearch-hadoop