{"id":13713393,"url":"https://github.com/lmas/Damerau-Levenshtein","last_synced_at":"2025-05-06T23:31:57.129Z","repository":{"id":57509157,"uuid":"188267613","full_name":"lmas/Damerau-Levenshtein","owner":"lmas","description":"This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein","archived":true,"fork":false,"pushed_at":"2023-07-21T09:51:43.000Z","size":38,"stargazers_count":11,"open_issues_count":0,"forks_count":3,"subscribers_count":3,"default_branch":"master","last_synced_at":"2024-11-14T00:33:52.011Z","etag":null,"topics":["damerau","damerau-levenshtein-distance","go","levenshtein"],"latest_commit_sha":null,"homepage":"","language":"Go","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/lmas.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-05-23T16:10:59.000Z","updated_at":"2024-08-03T14:56:53.000Z","dependencies_parsed_at":"2024-06-19T06:14:59.652Z","dependency_job_id":"e4c46059-ff46-4ac1-b9bc-3c5ad3f972cc","html_url":"https://github.com/lmas/Damerau-Levenshtein","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lmas%2FDamerau-Levenshtein","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lmas%2FDamerau-Levenshtein/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lmas%2FDamerau-Levenshtein/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lmas%2FDamerau-Levenshtein/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lmas","download_url":"https://codeload.github.com/lmas/Damerau-Levenshtein/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252787531,"owners_count":21804278,"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":["damerau","damerau-levenshtein-distance","go","levenshtein"],"created_at":"2024-08-02T23:01:34.865Z","updated_at":"2025-05-06T23:31:55.692Z","avatar_url":"https://github.com/lmas.png","language":"Go","funding_links":[],"categories":["Repositories"],"sub_categories":[],"readme":"\nDamerau-Levenshtein\n================================================================================\n\n[![GoDoc](https://godoc.org/github.com/lmas/Damerau-Levenshtein?status.svg)](https://godoc.org/github.com/lmas/Damerau-Levenshtein)\n\nCalculate and return the True Damerau–Levenshtein distance of string A and B.\n\nSee [Issue #2](https://github.com/lmas/Damerau-Levenshtein/issues/2) for a list\nof research papers used as a reference when implementing the algorithm and a\nminor struggle trying to verify the results.\n\nExample\n--------------------------------------------------------------------------------\n\nInstall package:\n\n        go get github.com/lmas/Damerau-Levenshtein\n\nGet distance between string A and B:\n\n        package main\n\n        import (\n                \"fmt\"\n                tdl \"github.com/lmas/Damerau-Levenshtein\"\n        )\n\n        func main() {\n                dist := tdl.Distance(\"CA\", \"ABC\")\n                fmt.Println(dist)\n        }\n\nOr if you want more performant code and want to avoid memory allocations:\n\n        func main() {\n                // Set a max length of 100 characters for strings A and B\n                t := tdl.New(100)\n                dist := t.Distance(\"CA\", \"ABC\")\n                fmt.Println(dist)\n                dist := t.Distance(\"AC\", \"ABC\")\n                fmt.Println(dist)\n        }\n\nTake a look at the tests for more examples.\n\nLicense\n--------------------------------------------------------------------------------\n\nMIT License, see the LICENSE file.\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flmas%2FDamerau-Levenshtein","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flmas%2FDamerau-Levenshtein","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flmas%2FDamerau-Levenshtein/lists"}