{"id":20661493,"url":"https://github.com/deepsyx/text-resume-analyzer","last_synced_at":"2025-10-24T17:08:13.998Z","repository":{"id":77119220,"uuid":"44254637","full_name":"deepsyx/text-resume-analyzer","owner":"deepsyx","description":"(C++) Creates a short resume based on text","archived":false,"fork":false,"pushed_at":"2015-10-14T15:05:46.000Z","size":156,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-08-18T10:01:53.559Z","etag":null,"topics":["cpp","intersection","naive-algorithm","nlp","sentence"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-2.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/deepsyx.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":"2015-10-14T14:47:51.000Z","updated_at":"2020-06-04T17:49:33.000Z","dependencies_parsed_at":"2023-03-06T07:01:20.823Z","dependency_job_id":null,"html_url":"https://github.com/deepsyx/text-resume-analyzer","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/deepsyx/text-resume-analyzer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deepsyx%2Ftext-resume-analyzer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deepsyx%2Ftext-resume-analyzer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deepsyx%2Ftext-resume-analyzer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deepsyx%2Ftext-resume-analyzer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/deepsyx","download_url":"https://codeload.github.com/deepsyx/text-resume-analyzer/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/deepsyx%2Ftext-resume-analyzer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":270975219,"owners_count":24678263,"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","status":"online","status_checked_at":"2025-08-18T02:00:08.743Z","response_time":89,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["cpp","intersection","naive-algorithm","nlp","sentence"],"created_at":"2024-11-16T19:09:51.816Z","updated_at":"2025-10-24T17:08:13.909Z","avatar_url":"https://github.com/deepsyx.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# text-resume-analyzer\n\nNaive text summarization algorithm in C++11 with wrapper for NodeJS. It was used in Smartly project and won first place in various IT competitions and olympiads.\n\n### Version\n0.1.0\n\n### Installation\n\nIn order to compile you need to have `NodeJS` and `npm` installed.\nYou'll also need a C++ compiler, I was using the compiler integrated into Visual studio 2013. To build the module, go into it's directory and execute `npm build .`\n\n### Usage\n\nInclude in your NodeJS application with \n\n    var SmartlyParser = require('smartparser');\n    \n    var char_limit = 35 * 5; // chars limit\n    var title = 'Black mamba'; // text title, has double weight\n    var text = 'Big text for black mamba here'; // full text to be sumarized\n    \n    SmartlyParser.parse('Huge text', 'Text title', char_limit, function(err, result) {\n        console.log(result);\n    });\n    \n### Why naive algorithm works. (Wikipedia explanation)\n\nParagraphs are logical atomic unit of the text and the is a reason why the author decided to split his text that way. The second (and maybe less obvious..) reason is that if two sentences have a good intersection, they probably holds the same information. So if one sentence has a good intersection with many other sentences, it probably holds some information from each one of them- or in other words, this is probably a key sentence in our text!","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeepsyx%2Ftext-resume-analyzer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdeepsyx%2Ftext-resume-analyzer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdeepsyx%2Ftext-resume-analyzer/lists"}