{"id":28780721,"url":"https://github.com/rapidfuzz/rapidfuzz-rs","last_synced_at":"2025-12-12T13:04:13.656Z","repository":{"id":174461085,"uuid":"254638709","full_name":"rapidfuzz/rapidfuzz-rs","owner":"rapidfuzz","description":"Rapid fuzzy string matching in Rust using various string metrics ","archived":false,"fork":false,"pushed_at":"2024-06-29T17:54:30.000Z","size":597,"stargazers_count":54,"open_issues_count":6,"forks_count":5,"subscribers_count":2,"default_branch":"main","last_synced_at":"2025-06-05T08:09:19.106Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"https://docs.rs/rapidfuzz/latest/rapidfuzz/","language":"Rust","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/rapidfuzz.png","metadata":{"files":{"readme":"Readme.md","changelog":"CHANGELOG.rst","contributing":null,"funding":null,"license":"LICENSE-APACHE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":"SECURITY.md","support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2020-04-10T13:15:44.000Z","updated_at":"2025-05-14T13:20:22.000Z","dependencies_parsed_at":null,"dependency_job_id":"a07c16e4-244a-4b41-b803-940717e8de55","html_url":"https://github.com/rapidfuzz/rapidfuzz-rs","commit_stats":null,"previous_names":["maxbachmann/rapidfuzz-rs","rapidfuzz/rapidfuzz-rs"],"tags_count":5,"template":false,"template_full_name":null,"purl":"pkg:github/rapidfuzz/rapidfuzz-rs","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rapidfuzz%2Frapidfuzz-rs","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rapidfuzz%2Frapidfuzz-rs/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rapidfuzz%2Frapidfuzz-rs/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rapidfuzz%2Frapidfuzz-rs/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/rapidfuzz","download_url":"https://codeload.github.com/rapidfuzz/rapidfuzz-rs/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/rapidfuzz%2Frapidfuzz-rs/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260415154,"owners_count":23005509,"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":"2025-06-17T18:08:16.701Z","updated_at":"2025-12-12T13:04:13.650Z","avatar_url":"https://github.com/rapidfuzz.png","language":"Rust","funding_links":[],"categories":[],"sub_categories":[],"readme":"\u003ch1 align=\"center\"\u003e\n\u003cimg src=\"https://raw.githubusercontent.com/rapidfuzz/rapidfuzz/master/docs/img/RapidFuzz.svg?sanitize=true\" alt=\"RapidFuzz\" width=\"400\"\u003e\n\u003c/h1\u003e\n\u003ch4 align=\"center\"\u003eRapid fuzzy string matching in Rust using the Levenshtein Distance\u003c/h4\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"https://github.com/rapidfuzz/rapidfuzz-rs/actions\"\u003e\n    \u003cimg src=\"https://github.com/rapidfuzz/rapidfuzz-rs/workflows/Rust/badge.svg\"\n         alt=\"Continous Integration\"\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://gitter.im/rapidfuzz/community\"\u003e\n    \u003cimg src=\"https://badges.gitter.im/rapidfuzz/community.svg\"\n         alt=\"Gitter chat\"\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://rapidfuzz.github.io/rapidfuzz\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/-documentation-blue\"\n         alt=\"Documentation\"\u003e\n  \u003c/a\u003e\n  \u003ca href=\"https://img.shields.io/crates/l/rapidfuzz.svg\"\u003e\n    \u003cimg src=\"https://img.shields.io/crates/l/rapidfuzz.svg\"\n         alt=\"license\"\u003e\n  \u003c/a\u003e\n\u003c/p\u003e\n\n\u003cp align=\"center\"\u003e\n  \u003ca href=\"#description\"\u003eDescription\u003c/a\u003e •\n  \u003ca href=\"#installation\"\u003eInstallation\u003c/a\u003e •\n  \u003ca href=\"#usage\"\u003eUsage\u003c/a\u003e •\n  \u003ca href=\"#license\"\u003eLicense\u003c/a\u003e\n\u003c/p\u003e\n\n---\n## Description\n\nRapidFuzz is a general purpose string matching library with implementations\nfor Rust, C++ and Python.\n\n### Key Features\n\n- **Diverse String Metrics**: Offers a variety of string metrics\n  to suit different use cases. These range from the Levenshtein\n  distance for edit-based comparisons to the Jaro-Winkler similarity for\n  more nuanced similarity assessments.\n- **Optimized for Speed**: The library is designed with performance in mind.\n  Each implementation is carefully designed to ensure optimal performance,\n  making it suitable for the analysis of large datasets.\n- **Easy to use**: The API is designed to be simple to use, while still giving\n  the implementation room for optimization.\n\n## Installation\n\nThe installation is as simple as:\n```console\n$ cargo add rapidfuzz\n```\n\n## Usage\n\nThe following examples show the usage with the Levenshtein distance. Other metrics\ncan be found in the [fuzz](https://docs.rs/rapidfuzz/latest/rapidfuzz/fuzz/index.html) and [distance](https://docs.rs/rapidfuzz/latest/rapidfuzz/distance/index.html) modules.\n\n```rust\nuse rapidfuzz::distance::levenshtein;\n\n// Perform a simple comparision using he levenshtein distance\nassert_eq!(\n    3,\n    levenshtein::distance(\"kitten\".chars(), \"sitting\".chars())\n);\n\n// If you are sure the input strings are ASCII only it's usually faster to operate on bytes\nassert_eq!(\n    3,\n    levenshtein::distance(\"kitten\".bytes(), \"sitting\".bytes())\n);\n\n// You can provide a score_cutoff value to filter out strings with distance that is worse than\n// the score_cutoff\nassert_eq!(\n    None,\n    levenshtein::distance_with_args(\n        \"kitten\".chars(),\n        \"sitting\".chars(),\n        \u0026levenshtein::Args::default().score_cutoff(2)\n    )\n);\n\n// You can provide a score_hint to tell the implementation about the expected score.\n// This can be used to select a more performant implementation internally, but might cause\n// a slowdown in cases where the distance is actually worse than the score_hint\nassert_eq!(\n    3,\n    levenshtein::distance_with_args(\n        \"kitten\".chars(),\n        \"sitting\".chars(),\n        \u0026levenshtein::Args::default().score_hint(2)\n    )\n);\n\n// When comparing a single string to multiple strings you can use the\n// provided `BatchComparators`. These can cache part of the calculation\n// which can provide significant speedups\nlet scorer = levenshtein::BatchComparator::new(\"kitten\".chars());\nassert_eq!(3, scorer.distance(\"sitting\".chars()));\nassert_eq!(0, scorer.distance(\"kitten\".chars()));\n```\n\n\n## License\nLicensed under either of [Apache License, Version\n2.0](https://github.com/rapidfuzz/rapidfuzz-rs/blob/main/LICENSE-APACHE) or [MIT License](https://github.com/rapidfuzz/rapidfuzz-rs/blob/main/LICENSE-MIT) at your option.\n\nUnless you explicitly state otherwise, any contribution intentionally submitted\nfor inclusion in RapidFuzz by you, as defined in the Apache-2.0 license, shall be\ndual licensed as above, without any additional terms or conditions.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frapidfuzz%2Frapidfuzz-rs","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Frapidfuzz%2Frapidfuzz-rs","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Frapidfuzz%2Frapidfuzz-rs/lists"}