{"id":16832300,"url":"https://github.com/rf-/levenshtein-19","last_synced_at":"2025-03-18T00:49:28.093Z","repository":{"id":138007000,"uuid":"2817174","full_name":"rf-/levenshtein-19","owner":"rf-","description":"1.9-compatible version of the Levenshtein gem","archived":false,"fork":false,"pushed_at":"2013-02-12T00:20:37.000Z","size":108,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-09T01:13:36.836Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"other","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/rf-.png","metadata":{"files":{"readme":"README","changelog":"CHANGELOG","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":"2011-11-21T02:41:55.000Z","updated_at":"2015-05-26T13:50:53.000Z","dependencies_parsed_at":"2023-04-09T23:47:53.283Z","dependency_job_id":null,"html_url":"https://github.com/rf-/levenshtein-19","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rf-%2Flevenshtein-19","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rf-%2Flevenshtein-19/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rf-%2Flevenshtein-19/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rf-%2Flevenshtein-19/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rf-","download_url":"https://codeload.github.com/rf-/levenshtein-19/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244135897,"owners_count":20403797,"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-13T11:48:26.105Z","updated_at":"2025-03-18T00:49:28.058Z","avatar_url":"https://github.com/rf-.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"The Levenshtein distance is a metric for measuring the amount of difference\nbetween two sequences (i.e., the so called edit distance). The Levenshtein\ndistance between two sequences is given by the minimum number of operations\nneeded to transform one sequence into the other, where an operation is an\ninsertion, deletion, or substitution of a single element.\n\nThe two sequences can be two strings, two arrays, or two other objects.\nStrings, arrays and arrays of strings are handled with optimized (very fast) C\ncode. All other sequences are handled with generic (fast) C code.\n\nMore information about the Levenshtein distance algorithm:\nhttp://en.wikipedia.org/wiki/Levenshtein_distance .\n\nNOTE: This gem was written by Erik Veenstra. I have made slight modifications\nto it for compatibility with Ruby 1.9.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frf-%2Flevenshtein-19","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frf-%2Flevenshtein-19","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frf-%2Flevenshtein-19/lists"}