{"id":21033332,"url":"https://github.com/aosync/levenshtein","last_synced_at":"2025-05-15T13:32:05.480Z","repository":{"id":62421409,"uuid":"264303026","full_name":"aosync/levenshtein","owner":"aosync","description":"Deno module to compute the Levenshtein distance between two strings","archived":false,"fork":false,"pushed_at":"2020-05-20T19:33:05.000Z","size":4,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-04-03T09:41:35.455Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"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/aosync.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}},"created_at":"2020-05-15T21:31:17.000Z","updated_at":"2022-09-29T18:14:15.000Z","dependencies_parsed_at":"2022-11-01T17:32:21.836Z","dependency_job_id":null,"html_url":"https://github.com/aosync/levenshtein","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aosync%2Flevenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aosync%2Flevenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aosync%2Flevenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/aosync%2Flevenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/aosync","download_url":"https://codeload.github.com/aosync/levenshtein/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":254349458,"owners_count":22056352,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":[],"created_at":"2024-11-19T12:54:17.604Z","updated_at":"2025-05-15T13:32:04.397Z","avatar_url":"https://github.com/aosync.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# levenshtein\n\nImplementation of the Wagner-Fischer algorithm to compute the Levenshtein distance between two strings.\n\n## Usage\n\n```typescript\nimport levenshtein from \"https://deno.land/x/levenshtein/mod.ts\";\n\nlevenshtein(\"kitten\", \"sitting\"); // 3\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faosync%2Flevenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Faosync%2Flevenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Faosync%2Flevenshtein/lists"}