{"id":17086406,"url":"https://github.com/dasch/levenshtein","last_synced_at":"2025-04-12T21:40:59.137Z","repository":{"id":53481994,"uuid":"164669784","full_name":"dasch/levenshtein","owner":"dasch","description":"An Elm implementation of the Levenshtein distance algorithm.","archived":false,"fork":false,"pushed_at":"2021-03-29T12:18:13.000Z","size":32,"stargazers_count":4,"open_issues_count":2,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-23T08:22:05.146Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Elm","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"apache-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dasch.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":"2019-01-08T14:47:09.000Z","updated_at":"2023-10-23T05:28:45.000Z","dependencies_parsed_at":"2022-08-18T18:23:52.576Z","dependency_job_id":null,"html_url":"https://github.com/dasch/levenshtein","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dasch%2Flevenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dasch%2Flevenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dasch%2Flevenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dasch%2Flevenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dasch","download_url":"https://codeload.github.com/dasch/levenshtein/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":232354274,"owners_count":18510309,"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-10-14T13:28:33.801Z","updated_at":"2025-01-03T15:25:18.059Z","avatar_url":"https://github.com/dasch.png","language":"Elm","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Levenshtein\n\nLevenshtein distance is a metric for measuring the difference between two strings. Specifically, it is the minimum number of single-character edits (insertions, deletions, or substitutions) required to change one string into the other.\n\n## Example\n\n```elm\nimport Levenshtein\n\nLevenshtein.distance \"kitten\" \"sitting\" --\u003e 3\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdasch%2Flevenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdasch%2Flevenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdasch%2Flevenshtein/lists"}