Built something? We create video reels & spotlights for GitHub projects.Promote your project →
Catalog / tonvanbart / clojure-levenshtein
Public GitHub Catalog Discovered Sep 25, 2026

tonvanbart / clojure-levenshtein

Learning clojure by implementing the Levenshtein algorithm. This is an algorithm to calculate the "edit distance" between two strings, or the number of insertions, deletions and replacements to get from one string to the other. See http://en.wikipedia.org/wiki/Levenshtein_distance .

View repository on GitHub ↗ View creator profile Browse directory

About this discovery

This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.

#4340655GitHub System ID
tonvanbartOrganization / User
PublicVisibility
ActiveCatalog Status

More from tonvanbart

↗

tonvanbart/xxedemo

Contains a demo of an RSS feed with a malicious entity definition.

Discovered
↗

tonvanbart/groovy-java

A quick experiment with a mixed-language Maven project: Java, Groovy and Clojure.

Discovered
FOR MAINTAINERS

Built something? Put it in front of millions of developers.

We make a short reel about your project and post it across YouTube, Instagram, Threads, and X. Send a link, we do the rest.