{"id":26162377,"url":"https://github.com/wollmers/text-levenshtein-bv","last_synced_at":"2026-04-20T18:01:30.300Z","repository":{"id":56831470,"uuid":"73961377","full_name":"wollmers/Text-Levenshtein-BV","owner":"wollmers","description":"Levenshtein using bit vectors","archived":false,"fork":false,"pushed_at":"2022-05-23T05:14:05.000Z","size":90,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-11T13:54:30.709Z","etag":null,"topics":["alignment","bit-vector","distance","levenshtein"],"latest_commit_sha":null,"homepage":"","language":"Perl","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/wollmers.png","metadata":{"files":{"readme":"README.md","changelog":"Changes","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":"2016-11-16T21:10:12.000Z","updated_at":"2022-01-21T06:14:27.000Z","dependencies_parsed_at":"2022-08-28T20:10:46.901Z","dependency_job_id":null,"html_url":"https://github.com/wollmers/Text-Levenshtein-BV","commit_stats":null,"previous_names":[],"tags_count":7,"template":false,"template_full_name":null,"purl":"pkg:github/wollmers/Text-Levenshtein-BV","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FText-Levenshtein-BV","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FText-Levenshtein-BV/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FText-Levenshtein-BV/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FText-Levenshtein-BV/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/wollmers","download_url":"https://codeload.github.com/wollmers/Text-Levenshtein-BV/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/wollmers%2FText-Levenshtein-BV/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32059139,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-20T11:35:06.609Z","status":"ssl_error","status_checked_at":"2026-04-20T11:34:48.899Z","response_time":94,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"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":["alignment","bit-vector","distance","levenshtein"],"created_at":"2025-03-11T13:54:13.482Z","updated_at":"2026-04-20T18:01:30.273Z","avatar_url":"https://github.com/wollmers.png","language":"Perl","funding_links":[],"categories":[],"sub_categories":[],"readme":"# NAME\n\nText::Levenshtein::BV - Bit Vector (BV) implementation of the\n                 Levenshtein Algorithm\n\n\u003cdiv\u003e\n    \u003ca href='http://cpants.cpanauthors.org/dist/Text-Levenshtein-BV'\u003e\u003cimg src='http://cpants.cpanauthors.org/dist/Text-Levenshtein-BV.png' alt='Kwalitee Score' /\u003e\u003c/a\u003e\n    \u003ca href=\"http://badge.fury.io/pl/Text-Levenshtein-BV\"\u003e\u003cimg src=\"https://badge.fury.io/pl/Text-Levenshtein-BV.svg\" alt=\"CPAN version\" height=\"18\"\u003e\u003c/a\u003e\n\u003c/div\u003e\n\n# SYNOPSIS\n\n    use Text::Levenshtein::BV;\n\n    my $lev = Text::Levenshtein::BV-\u003enew;\n    my $ses = $lev-\u003eSES(\\@a,\\@b);\n\n# ABSTRACT\n\nText::Levenshtein::BV implements the Levenshtein algorithm using bit vectors and\nis faster in most cases than the naive implementation using a match matrix.\n\n# DESCRIPTION\n\n## CONSTRUCTOR\n\n- new()\n\n    Creates a new object which maintains internal storage areas\n    for the SES computation.  Use one of these per concurrent\n    SES() call.\n\n## METHODS\n\n- SES(\\\\@a,\\\\@b)\n\n    Finds a Shortest Edit Script (SES), taking two arrayrefs as method\n    arguments. It returns an array reference of corresponding\n    indices, which are represented by 2-element array refs.\n\n- distance(\\\\@a,\\\\@b)\n\n    Calculates the edit distance, taking two arrayrefs as method\n    arguments. It returns an integer.\n\n- hunks2sequences(\\\\@alignment)\n\n    Reformats the alignment returned by SES into an array of two sequences.\n\n- sequence2char(\\\\@a)\n\n    Renders an array of strings into a string.\n\n- sequences2hunks(\\\\@a,\\\\@b)\n\n    Does the reverse of method hunks2sequences.\n\n- hunks2char(\\\\@a,\\\\@b,\\\\@alignment)\n\n    Returns hunks of aligned characters.\n\n- hunks2distance(\\\\@a,\\\\@b,\\\\@alignment)\n\n    Calculates the distance from alignment.\n\n## EXPORT\n\nNone by design.\n\n# STABILITY\n\nUntil release of version 1.00 the included methods, names of methods and their\ninterfaces are subject to change.\n\nBeginning with version 1.00 the specification will be stable, i.e. not changed between\nmajor versions.\n\n# REFERENCES\n\n\\[Hyy03\\]\nHyyrö, Heikki. (2003).\nA Bit-Vector Algorithm for Computing Levenshtein and Damerau Edit Distances.\nIn Nord. J. Comput. 10. 29-39.\n\n\\[Hyy04a\\]\nHyyrö, Heikki. (2004).\nA Note on Bit-Parallel Alignment Computation.\nIn M. Simanek and J. Holub, editors, Stringology, pages 79-87.\nDepartment of Computer Science and Engineering, Faculty of Electrical\nEngineering, Czech Technical University, 2004.\n\n\\[Hyy04b\\]\nHyyrö, Heikki. (2004).\nBit-parallel LCS-length computation revisited.\nIn Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004), 2004.\n\n\\[HN02\\]\nHyyrö, Heikki and Navarro, Gonzalo.\nFaster bit-parallel approximate string matching.\nIn Proc. 13th Combinatorial Pattern Matching (CPM 2002),\nLNCS 2373, pages 203–224, 2002.\n\n\\[Myers99\\]\nMyers, Gene.\nA fast bit-vector algorithm for approximate string matching based on dynamic progamming.\nJournal of the ACM, 46(3):395–415, 1999.\n\n# SEE ALSO\n\n[Text::Levenshtein](https://metacpan.org/pod/Text%3A%3ALevenshtein)\n\n# SOURCE REPOSITORY\n\n[http://github.com/wollmers/Text-Levenshtein-BV](http://github.com/wollmers/Text-Levenshtein-BV)\n\n# AUTHOR\n\nHelmut Wollmersdorfer \u003chelmut@wollmersdorfer.at\u003e\n\n\u003cdiv\u003e\n    \u003ca href='http://cpants.cpanauthors.org/author/wollmers'\u003e\u003cimg src='http://cpants.cpanauthors.org/author/wollmers.png' alt='Kwalitee Score' /\u003e\u003c/a\u003e\n\u003c/div\u003e\n\n# COPYRIGHT AND LICENSE\n\nCopyright 2016-2022 by Helmut Wollmersdorfer\n\nThis library is free software; you can redistribute it and/or modify\nit under the same terms as Perl itself.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollmers%2Ftext-levenshtein-bv","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fwollmers%2Ftext-levenshtein-bv","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fwollmers%2Ftext-levenshtein-bv/lists"}