{"id":18604430,"url":"https://github.com/samuellucas97/best-matching","last_synced_at":"2026-04-25T08:36:10.196Z","repository":{"id":70064614,"uuid":"243587655","full_name":"Samuellucas97/Best-matching","owner":"Samuellucas97","description":"Implementation serial of Levenshtein distance algorithm.","archived":false,"fork":false,"pushed_at":"2020-10-13T19:57:27.000Z","size":28,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-06-28T14:43:26.216Z","etag":null,"topics":["algorithm","automated-testing","junit","levenshtein-distance","maven","serial-version"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Samuellucas97.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null}},"created_at":"2020-02-27T18:27:34.000Z","updated_at":"2020-03-22T04:33:45.000Z","dependencies_parsed_at":"2023-02-21T22:00:12.386Z","dependency_job_id":null,"html_url":"https://github.com/Samuellucas97/Best-matching","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Samuellucas97/Best-matching","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samuellucas97%2FBest-matching","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samuellucas97%2FBest-matching/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samuellucas97%2FBest-matching/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samuellucas97%2FBest-matching/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Samuellucas97","download_url":"https://codeload.github.com/Samuellucas97/Best-matching/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Samuellucas97%2FBest-matching/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32255722,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-25T04:23:17.126Z","status":"ssl_error","status_checked_at":"2026-04-25T04:21:53.360Z","response_time":59,"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":["algorithm","automated-testing","junit","levenshtein-distance","maven","serial-version"],"created_at":"2024-11-07T02:17:46.919Z","updated_at":"2026-04-25T08:36:10.170Z","avatar_url":"https://github.com/Samuellucas97.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Best-matching\n\n## Introduction  \n\nThis folder contains the implementation of the Big Data algorithm, Levenshtein distance. Given this, it refers to one of the activities of the _Concurrency Programming_ discipline taught by dr. Nélio Cacho Bachelor of Information Technology at the Federal University of Rio Grande do Norte (__UFRN__).\n\n\n- [Prerequisites](#prerequisites) - Project prerequisites\n- [About the algorithm](#about-the-algorithm) - Informations about the algorithm.\n- [Author](#author) - Project author.\n\n\n## Prerequisites\n\nYou need the following programs to use this repository:\n\n - Maven\n - JDK 11\n\n_This project was loaded on Eclipse using above configurations_\n\n## About the algorithm\n\nIn resume, the Levenshtein distance is a string metric for measuring the difference between two sequences. Informally, the Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other. \n\n## Author \n\n| Name: | Email: |  \n| ---------- | ------------- | \n|`Samuel Lucas de Moura Ferino` \t| _samuellucas97@ufrn.edu.br_  \n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuellucas97%2Fbest-matching","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsamuellucas97%2Fbest-matching","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsamuellucas97%2Fbest-matching/lists"}