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
tree-conflict
modelchoicefield
edsdk
production-release
chalice
rsm
pls
r-ape
reswift
git-commit
rfid
scrolltrigger
virtual-network
redis-server
hivemq
pattern-synonyms
multiple-axes
dia
sparklyr
afnetworking-3
random-data
pixel-density
propositional-calculus
valign
multi-select
pytest-parallel
watchpoint
repaint
azure-redis-cache
url-masking
