{"id":31029727,"url":"https://github.com/negcx/seqfuzz","last_synced_at":"2025-09-13T22:48:11.327Z","repository":{"id":49590779,"uuid":"272248747","full_name":"negcx/seqfuzz","owner":"negcx","description":"Sublime Text-like sequential fuzzy string matching for Elixir.","archived":false,"fork":false,"pushed_at":"2023-10-08T17:10:31.000Z","size":19,"stargazers_count":13,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-07-08T06:53:34.678Z","etag":null,"topics":["elixir","fuzzy-search"],"latest_commit_sha":null,"homepage":"","language":"Elixir","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/negcx.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-06-14T17:15:29.000Z","updated_at":"2024-04-26T04:55:53.000Z","dependencies_parsed_at":"2022-09-05T10:51:36.355Z","dependency_job_id":null,"html_url":"https://github.com/negcx/seqfuzz","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/negcx/seqfuzz","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/negcx%2Fseqfuzz","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/negcx%2Fseqfuzz/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/negcx%2Fseqfuzz/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/negcx%2Fseqfuzz/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/negcx","download_url":"https://codeload.github.com/negcx/seqfuzz/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/negcx%2Fseqfuzz/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":274997547,"owners_count":25387934,"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-09-13T02:00:10.085Z","response_time":70,"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":["elixir","fuzzy-search"],"created_at":"2025-09-13T22:48:09.725Z","updated_at":"2025-09-13T22:48:11.314Z","avatar_url":"https://github.com/negcx.png","language":"Elixir","funding_links":[],"categories":[],"sub_categories":[],"readme":"Seqfuzz is an implementation of a sequential fuzzy string matching algorithm, similar to those used in code editors like Sublime Text. It is based on Forrest Smith's work on [lib_ftps](https://github.com/forrestthewoods/lib_fts/) and his blog post [Reverse Engineering Sublime Text's Fuzzy Match](https://www.forrestthewoods.com/blog/reverse_engineering_sublime_texts_fuzzy_match/).\n\nThere is an alternate implementation by [@WolfDan](https://github.com/WolfDan) which can be found here: [Fuzzy Match v0.2.0 Elixir](https://github.com/tajmone/fuzzy-search/tree/master/fts_fuzzy_match/0.2.0/elixir).\n\n### Documentation\n\n- **GitHub**: [https://github.com/negcx/seqfuzz](https://github.com/negcx/seqfuzz)\n- **Hexdocs**: [https://hexdocs.pm/seqfuzz](https://hexdocs.pm/seqfuzz)\n\n## Installation\n\nThe package can be installed by adding `seqfuzz` to your list of dependencies in `mix.exs`:\n\n```elixir\ndef deps do\n  [\n    {:seqfuzz, \"~\u003e 0.2.0\"}\n  ]\nend\n```\n\n## Examples\n\n      iex\u003e Seqfuzz.match(\"Hello, world!\", \"hellw\")\n      %{match?: true, matches: [0, 1, 2, 3, 7], score: 202}\n\n      iex\u003e items = [{1, \"Hello Goodbye\"}, {2, \"Hell on Wheels\"}, {3, \"Hello, world!\"}]\n      iex\u003e Seqfuzz.filter(items, \"hellw\", \u0026(elem(\u00261, 1)))\n      [{3, \"Hello, world!\"}, {2, \"Hell on Wheels\"}]\n\n## Scoring\n\nScores can be passed as options if you want to override the defaults. I have added additional separators as a default as well as two additional scoring features: case match bonus and string match bonus. Case match bonus provides a small bonus for matching case. String match bonus provides a large bonus when the pattern and the string match exactly (although with different cases) to make sure that those results are always highest.\n\n## Changelog\n\n- `0.2.0` - Change scoring to be via options instead of configuration.\n- `0.1.0` - Initial version. Supports basic algorithm but does not search recursively for better matches.\n\n## Roadmap\n\n- Add support for recursive search for better matches.\n- Add support for asynchronous stream search.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnegcx%2Fseqfuzz","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnegcx%2Fseqfuzz","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnegcx%2Fseqfuzz/lists"}