{"id":15506499,"url":"https://github.com/terasum/js-bktree","last_synced_at":"2025-06-18T00:34:19.014Z","repository":{"id":57282854,"uuid":"139511204","full_name":"terasum/js-bktree","owner":"terasum","description":"Burkhard-Keller Tree (BK-Tree)  js implements","archived":false,"fork":false,"pushed_at":"2018-07-03T01:48:50.000Z","size":41,"stargazers_count":2,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-05-26T07:41:43.433Z","etag":null,"topics":["bktree"],"latest_commit_sha":null,"homepage":null,"language":"JavaScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/terasum.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":"2018-07-03T01:09:20.000Z","updated_at":"2023-02-06T21:02:14.000Z","dependencies_parsed_at":"2022-09-19T23:22:46.484Z","dependency_job_id":null,"html_url":"https://github.com/terasum/js-bktree","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/terasum/js-bktree","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/terasum%2Fjs-bktree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/terasum%2Fjs-bktree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/terasum%2Fjs-bktree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/terasum%2Fjs-bktree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/terasum","download_url":"https://codeload.github.com/terasum/js-bktree/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/terasum%2Fjs-bktree/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":260462313,"owners_count":23013074,"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":["bktree"],"created_at":"2024-10-02T09:28:03.179Z","updated_at":"2025-06-18T00:34:14.003Z","avatar_url":"https://github.com/terasum.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Burkhard-Keller Tree (BK-Tree) JavaScript implements\n\nThe BK-tree is a simillar words fuzzy search algorithm,\nyou can use this package search the simillar words from a\nlong terms list.\n\nThe edit distance calc algorithm is [Damerau–Levenshtein distance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance)\n\n## USAGE\n\n```js\nimport BKTree from \"../lib/bktree\";\n\nconst words = [\n\"Aani\", \"aardvark\", \"aardwolf\", \"Aaron\", \"Aaronic\",\n\"Aaronical\", \"Aaronite\", \"Aaronitic\", \"Aaru\", \"Ab\",  \"aba\", \"Ababdeh\", \"Ababua\", \"abac\",\n\"abaca\", \"abacate\", \"abacay\", \"abacinate\", \"abacination\", \"abaciscus\", \"abacist\", \"aback\",\n\"abactinal\", \"abactinally\", \"abaction\", \"abactor\",\"abaculus\", \"abacus\", \"Abadite\", \"abaff\",\n\"abaft\", \"abaisance\", \"abaiser\", \"abaissed\", \"abalienate\", \"abalienation\", \"abalone\",\n\"Abama\", \"abampere\", \"abandon\", \"abandonable\",\"abandoned\", \"abandonedly\", \"abandonee\",\n\"abandoner\", \"abandonment\",\"Abanic\", \"Abantes\",\"abaptiston\", \"Abarambo\", \"Abaris\",\n\"abarthrosis\", \"abarticular\",\"abarticulation\", \"abas\", \"abase\", \"abased\", \"abasedly\",\n\"abasedness\", \"abasement\",\"abaser\", \"Abasgi\", \"abash\", \"abashed\", \"abashedly\", \"abashedness\",\n\"abashless\",\"abashlessly\", \"abashment\", \"abasia\", \"abasic\", \"abask\", \"Abassin\",\n\"abastardize\",\"abatable\", \"abate\", \"abatement\", \"abater\", \"abatis\", \"abatised\", \"abaton\",\n\"abator\",\"abattoir\", \"Abatua\", \"abature\", \"abave\", \"abaxial\", \"abaxile\", \"abaze\", \"abb\",\n\"Abba\",\"abbacomes\", \"abbacy\", \"Abbadide\" ] ;\n\n\nconst bktree = new BKTree(words.length);\nbktree.add(words);\nconsole.log(bktree.simWords(\"anic\", 2));\n// [ 'Aani', 'Abanic' ]\n```","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fterasum%2Fjs-bktree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fterasum%2Fjs-bktree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fterasum%2Fjs-bktree/lists"}