{"id":22725387,"url":"https://github.com/delonnewman/mini-levenshtein","last_synced_at":"2025-10-09T11:15:42.958Z","repository":{"id":57676221,"uuid":"487071349","full_name":"delonnewman/mini-levenshtein","owner":"delonnewman","description":"Simple, fast Levenshtein distance and similarity ratio for Ruby","archived":false,"fork":false,"pushed_at":"2023-12-08T05:51:37.000Z","size":59,"stargazers_count":29,"open_issues_count":4,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-10-01T15:34:39.729Z","etag":null,"topics":["algorithms","comparison","fuzzy-matching","levenshtein-distance","natural-language-processing","nlp","ruby","ruby-extension","string-matching","text"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/delonnewman.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2022-04-29T18:20:12.000Z","updated_at":"2025-04-08T01:44:37.000Z","dependencies_parsed_at":"2023-01-29T01:02:10.059Z","dependency_job_id":null,"html_url":"https://github.com/delonnewman/mini-levenshtein","commit_stats":null,"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"purl":"pkg:github/delonnewman/mini-levenshtein","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/delonnewman%2Fmini-levenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/delonnewman%2Fmini-levenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/delonnewman%2Fmini-levenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/delonnewman%2Fmini-levenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/delonnewman","download_url":"https://codeload.github.com/delonnewman/mini-levenshtein/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/delonnewman%2Fmini-levenshtein/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279001293,"owners_count":26083058,"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","status":"online","status_checked_at":"2025-10-09T02:00:07.460Z","response_time":59,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["algorithms","comparison","fuzzy-matching","levenshtein-distance","natural-language-processing","nlp","ruby","ruby-extension","string-matching","text"],"created_at":"2024-12-10T16:09:58.349Z","updated_at":"2025-10-09T11:15:42.913Z","avatar_url":"https://github.com/delonnewman.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![Ruby](https://github.com/delonnewman/mini-levenshtein/actions/workflows/ruby.yml/badge.svg)](https://github.com/delonnewman/mini-levenshtein/actions/workflows/ruby.yml)\n\n# MiniLevenshtein\n\nSimple, fast, levenshtein distance and similarity ratio for Ruby\n\n# Synopsis\n\n```ruby\nMiniLevenshtein.edit_distance(\"levenshtein\", \"levenstien\") # =\u003e 3\n\nMiniLevenshtein.similarity(\"levenshtein\", \"levenstien\") # 0.857142...\n```\n\n# Why?\n\nWhile there are many levenshtein distance implementations for Ruby, none provided a means to adjust edit scoring to make the calcuations suitable for a similarity ratio.\n\n# See Also\n\n- [python-levenshtein](https://github.com/ztane/python-Levenshtein)\n- [Various Ruby Implementations](https://rubygems.org/search?query=levenshtein)\n- https://en.wikipedia.org/wiki/Levenshtein_distance\n\n# Credits\n\n## Ruby Bindings\n\nDelon Newman \u003ccontact@delonnewman.name\u003e\n\n## Original C Code\n\n- David Necas (Yeti) \u003cyeti@physics.muni.cz\u003e\n- Atakan Gurkan\n- James Theiler\n- Brian Gough\n\n(see [ext/mini_levenshtein/levenshtein.c](https://github.com/delonnewman/mini-levenshtein/blob/master/ext/mini_levenshtein/levenshtein.c) for more)\n\n# License\n\nThe gem is available as open source under the terms of the [GPL](https://opensource.org/licenses/GPL-2.0).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdelonnewman%2Fmini-levenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdelonnewman%2Fmini-levenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdelonnewman%2Fmini-levenshtein/lists"}