{"id":31813663,"url":"https://github.com/silvermannn/cdplayer","last_synced_at":"2025-10-11T08:20:35.489Z","repository":{"id":314579233,"uuid":"1055930049","full_name":"silvermannn/CDPlayer","owner":"silvermannn","description":null,"archived":false,"fork":false,"pushed_at":"2025-09-27T11:10:03.000Z","size":241,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-09-27T13:07:22.923Z","etag":null,"topics":["c","capi","conceptual-dependency","cpp","edmonds-algorithm","fuzzy-logic","haskell","haskell-ffi","hidden-markov-model","nlp","rule-based-system","viterbi-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Haskell","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/silvermannn.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,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2025-09-13T04:10:11.000Z","updated_at":"2025-09-27T11:10:06.000Z","dependencies_parsed_at":null,"dependency_job_id":"20ab3110-5690-409e-be78-7b3495515a4b","html_url":"https://github.com/silvermannn/CDPlayer","commit_stats":null,"previous_names":["silvermannn/cdplayer"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/silvermannn/CDPlayer","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/silvermannn%2FCDPlayer","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/silvermannn%2FCDPlayer/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/silvermannn%2FCDPlayer/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/silvermannn%2FCDPlayer/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/silvermannn","download_url":"https://codeload.github.com/silvermannn/CDPlayer/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/silvermannn%2FCDPlayer/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279006769,"owners_count":26084148,"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-10-11T02:00:06.511Z","response_time":55,"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":["c","capi","conceptual-dependency","cpp","edmonds-algorithm","fuzzy-logic","haskell","haskell-ffi","hidden-markov-model","nlp","rule-based-system","viterbi-algorithm"],"created_at":"2025-10-11T08:20:34.313Z","updated_at":"2025-10-11T08:20:35.485Z","avatar_url":"https://github.com/silvermannn.png","language":"Haskell","readme":"# CDPlayer\n\nОбработка текста с использованием идей концептуальных зависимостей Р. Шенка\n\n# Основные идеи и компоненты:\n\n- Токенайзер - пока самый простой, разбиваем входное предложение по пробельным символам\n- Словарь слов [OpenCorpora Dict](https://opencorpora.org)\n- Таггер: HMM, тренированная на файлах CoNLLU, корпуса [отсюда](https://github.com/natasha/corus) -- C++\n- Построение дерева зависимостей\n    - статистика из CoNLLU файлов (3D matrix *dependency head* -\u003e *to* -\u003e *dependency relation*)\n    - построение ориентированного графа из всех возможных зависимостей с весами из статистики\n    - нахождение минимального остовного дерева из искуственного корня, ([алгоритм двух китайцев](https://codeforces.com/blog/entry/20079), [Chu Liu Edmonds](https://en.wikipedia.org/wiki/Edmonds%27_algorithm) -- C++\n- Дерево зависимостей (или построенное на его основе другое синтаксическое дерево) как запрос к базе данных концептуальных зависимостей -- Haskell\n\n# TODO:\n\n- Добавить в словарь основную форму слова, которая будет нужна для построения правил. Возможно это есть в xml варианте словаря [OpenCorpora Dict](https://opencorpora.org) и на [WikiData](https://www.wikidata.org)\n- Добавить загрузку корпусов с [OpenCorpora Dict](https://opencorpora.org).\n- Идея одновременного проставления тегов частей речи и построения дерев зависимостей:\n    - каждому слову сопоставляется список всех возможных тегов\n    - есть набор правил вида (направление поска, что является родителем, что является потомком, вес правила), которые, начиная с дерева с одним элементом \"root\", строят (несколько) деревьев зависимостей с одновременным тегорованием\n    - сами правила, в теории, можно написать вручную, но можно использовать эволюционный алгоритм для их нахождения\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilvermannn%2Fcdplayer","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsilvermannn%2Fcdplayer","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsilvermannn%2Fcdplayer/lists"}