orangecrumbs
Loading the deck
Could not load the deck. Check the connection and reload.
Saved
orangecrumbs
Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.
Full article HN thread
Levenshtein Distance

Levenshtein Distance

▲ 215 💬 126

In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or…

No items match this view.
Try Shuffle or New.
HN ↗
Loading comments…
List Mode
Levenshtein Distance
Watch on YouTube

Levenshtein Distance

to move·?shortcuts
▲ 215💬 126

In information theory, linguistics, and computer science, the Levenshtein distance is a string metric for measuring the difference between two sequences. The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or…

Open on HN ↗
Loading comments…
Weekly Wikipedia digest

Get new Wikipedia articles popular on Hacker News - one email per week.

No spam. Unsubscribe anytime. · Privacy

You're on the list.A welcome note should arrive in a minute.Check Promotions or Spam if you do not see it.

Sort & filter

Sort
🔀 Shuffle
🕑 New
Upvotes
20+
50+
100+
200+
Type
All
Article
List