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
area
vuejs-transition-group
winui-3
poedit
phase
htk
react-navigation-top-tabs
key-events
secure-transport
emeditor
grasp
semantics
nuget
amazon-cognito-triggers
npm-registry
uiscrollview
intern
svgkit
opengl-es-3.1
ember-paper
alfresco
request-cancelling
gnome
valuestack
post-commit
divide-and-conquer
gcc4.7
miette
rets
python-onvif