{"payload":{"header_redesign_enabled":false,"results":[{"id":"375119836","archived":false,"color":"#3572A5","followers":2,"has_funding_file":false,"hl_name":"athlohangade/minimum-edit-distance","hl_trunc_description":"The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.","language":"Python","mirror":false,"owned_by_organization":false,"public":true,"repo":{"repository":{"id":375119836,"name":"minimum-edit-distance","owner_id":52750693,"owner_login":"athlohangade","updated_at":"2021-06-08T19:24:16.194Z","has_issues":true}},"sponsorable":false,"topics":["python","edit-distance","levenshtein-distance","dynamic-programming","wagner-fischer-algorithm","minimum-edit-distance"],"type":"Public","help_wanted_issues_count":0,"good_first_issue_issues_count":0,"starred_by_current_user":false}],"type":"repositories","page":1,"page_count":1,"elapsed_millis":93,"errors":[],"result_count":1,"facets":[],"protected_org_logins":[],"topics":null,"query_id":"","logged_in":false,"sign_up_path":"/signup?source=code_search_results","sign_in_path":"/login?return_to=https%3A%2F%2Fgithub.com%2Fsearch%3Fq%3Drepo%253Aathlohangade%252Fminimum-edit-distance%2B%2Blanguage%253APython","metadata":null,"warn_limited_results":false,"csrf_tokens":{"/athlohangade/minimum-edit-distance/star":{"post":"k24KlTY67G39gumr-lo1Q6LiLh-viOx51Qgw_kBt6Op7lqefe6xbkn86cghKrHAQHoRi-kjLp9NIFie4XQZl8A"},"/athlohangade/minimum-edit-distance/unstar":{"post":"rsiaJdYHCgLhlVDNkuS-yf_hgzwj4HIELFgFpC90eAJZbOe6sM4Kc1KTYPWWv9GjNZKCKSOk47Q9Vz7UswkmYQ"},"/sponsors/batch_deferred_sponsor_buttons":{"post":"K1gwrcPqGhxETBYFssrGdocGt6wOBhBj6kTqMXKV4PikpPNdOGTwbo1fJ0cFYmY7AIwGOZK_UiTn_b8Sckg6xQ"}}},"title":"Repository search results"}