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
huawei-push-notification
adodb
amazon-sns
seaweedfs
profiler
programmatically
genesis
hierarchical-data
iceweasel
lazy-static
service-fabric-on-premises
dotfiles
oracle-rdb
vagrant-ssh
xajax
d3-graphviz
cryptostream
amiga
atlasmap
ef-core-2.2
scikit-cuda
code39
silverlight-4.0
editpad
after-effects
visual-studio-2022
webgrabber
docx2txt
mapbox-api-vectortiles
reference-type