ByteCode.News
Front PageTagsFeeds
ByteCode.News
RSS
Front PageTagsFeeds
← Knowledge Base

levenshtein

By dreamreal|March 10, 2026|58 lookups
Text
A "levenshtein distance" is a string metric for measuring the difference between two sequences: it measures the number of edits it takes to go from one string to another. "cat" to "dog" is 3; "cat" to "sat" is 1.
Urls
https://en.wikipedia.org/wiki/Levenshtein_distance
← Back to Knowledge Base
bytecode.news

Technical writing, software engineering insights, and the craft of building things that work.

Sections

ArticlesFactoidsFeedsKarmaLogsPoliciesTerms of ServiceAbout

System

Backend v1.1.10Frontend v1.1.7

© 2026 bytecode.news

All rights reserved