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
wkhtmltopdf
callermembername
kafka-partition
thread-local-storage
modalpopup
fileshare
itoa
directorystream
automated-deploy
stroke
polygons
configurable-product
yahoo-oauth
spring-validator
nspersistentcontainer
tps
servletexception
timezone-offset
web-technologies
sqldatasource
typescript-class
dynamic-delivery
primefaces-datatable
https-redirect
opencv-contour
ignore-test
jasmin
callable
wscf
iscroll4