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
logitech-gaming-software
apache-commons-vfs
google-sheets-query
msw
wireframe
github-webhook
ump
c2x
cin
thread-priority
eventmachine
angular-token
voronoi
.when
eclipse-pde
test-class
auto-vectorization
datacontractserializer
stream-graph
data-import
overlayfs
microsoft-reporting
codevisionavr
snap
wiredtiger
import
pixastic
unattend-file
justpy
docker-volume