Implementing The Levenshtein Distance in Python
The Levenshtein distance is a text similarity measure that compares
two words and returns a numeric value representing the distance
between them. The distance reflects the total number of
single-character edits required to transform one word into
another. The more similar the two words are the less distance
between them, and vice versa. One common use for this distance is in
the autocompletion or autocorrection features of text processors or
Source: Implementing The Levenshtein Distance in
an article by Ahmed Fawzy Gad.
Dark Mode Revisited
Dark mode has gone from an oddity to being fully supported on
Safari, Firefox and Chrome. While this is great news (especially if
you also get migraines), it also means that my hacked together dark
mode post from less than
a year ago is outdated. Time for round two.
Source: Dark Mode
article by Derek Kedziora.
Be careful, Docker might be exposing ports to the world
Recently, I noticed logs for one of my web services had strange
entries that looked like a bot trying to perform scripted attacks on
an application endpoint. I was surprised, because all the endpoints
that were exposed over the public Internet were protected by some
form of authentication, or were locked down to specific IP
addresses—or so I thought.
Source: Be careful, Docker might be exposing ports to the
an article by Jeff Geerling.