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
ounit
tapply
microsoft-graph-groups
google-optimize
cosmosdb-notebook
shift-register
aws-dms
constants
flowable
visualizer
interactive-brokers
sp-send-dbmail
klarna
cplisttemplate
escape-analysis
nameko
orocrm
velocity.js
google-slides
using-directives
libx264
google-streetview-publish
visual-prolog
haskeline
deskband
arrayiterator
bank-conflict
cyanogenmod
ibmhttpserver
uiactivityitemsource