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
axon-framework
nltk-book
mean-stack
doi
azure-iot-hub
pykml
jdk1.4
spring-vault
ansi-nulls
web-mediarecorder
list-manipulation
ithit-ajax-file-browser
pid
blazer
oracle-maf
associated-types
hierarchical-trees
prime-factoring
grasshopper
ironsource
loading-animation
pyproject.toml
spryker
generic-foreign-key
adodb-php
system-shutdown
restivus
qhull
reference
tianshou