{"id":22221892,"url":"https://github.com/fabiospampinato/tiny-levenshtein","last_synced_at":"2026-02-21T23:03:38.892Z","repository":{"id":37538486,"uuid":"505937356","full_name":"fabiospampinato/tiny-levenshtein","owner":"fabiospampinato","description":"A tiny implementation of the Levenshtein edit distance algorithm.","archived":false,"fork":false,"pushed_at":"2025-06-29T18:55:43.000Z","size":12,"stargazers_count":13,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-08-31T00:45:54.003Z","etag":null,"topics":["distance","edit","levenshtein","tiny"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/fabiospampinato.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":"license","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null},"funding":{"github":"fabiospampinato","custom":"https://www.paypal.me/fabiospampinato"}},"created_at":"2022-06-21T17:14:27.000Z","updated_at":"2025-06-29T18:55:46.000Z","dependencies_parsed_at":"2024-06-20T23:31:20.081Z","dependency_job_id":"660f51b6-4bf6-4d9a-b90a-d70d3d3408aa","html_url":"https://github.com/fabiospampinato/tiny-levenshtein","commit_stats":{"total_commits":4,"total_committers":1,"mean_commits":4.0,"dds":0.0,"last_synced_commit":"308a9b3bf6d2d3e7fb6c4ed805842176779386b4"},"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"purl":"pkg:github/fabiospampinato/tiny-levenshtein","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fabiospampinato%2Ftiny-levenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fabiospampinato%2Ftiny-levenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fabiospampinato%2Ftiny-levenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fabiospampinato%2Ftiny-levenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/fabiospampinato","download_url":"https://codeload.github.com/fabiospampinato/tiny-levenshtein/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/fabiospampinato%2Ftiny-levenshtein/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29696889,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-21T18:18:25.093Z","status":"ssl_error","status_checked_at":"2026-02-21T18:18:22.435Z","response_time":107,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["distance","edit","levenshtein","tiny"],"created_at":"2024-12-02T23:16:02.906Z","updated_at":"2026-02-21T23:03:38.871Z","avatar_url":"https://github.com/fabiospampinato.png","language":"TypeScript","funding_links":["https://github.com/sponsors/fabiospampinato","https://www.paypal.me/fabiospampinato"],"categories":[],"sub_categories":[],"readme":"# Tiny Levenshtein\n\nA tiny implementation of the Levenshtein edit distance algorithm.\n\n## Install\n\n```sh\nnpm install tiny-levenshtein\n```\n\n## Usage\n\n```ts\nimport levenshtein from 'tiny-levenshtein';\n\n// Let's compute the Levenshtein edit distance between two strings\n// Strings are compared at the byte level\n\nlevenshtein ( 'kitten', 'sitting' ); // =\u003e 3\nlevenshtein ( '🤣', '😂' ); // =\u003e 2\n\n// Let's compute the Levenshtein edit distance between two arrays\n// Arrays are compared at the element level\n// This can double-down as Unicode-aware string comparison too\n\nlevenshtein ( [1, 2, 3], [1, 4, 3] ); // =\u003e 1\nlevenshtein ( [...'🤣'], [...'😂'] ); // =\u003e 1\n```\n\n## License\n\nMIT © Fabio Spampinato\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffabiospampinato%2Ftiny-levenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffabiospampinato%2Ftiny-levenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffabiospampinato%2Ftiny-levenshtein/lists"}