{"id":22220824,"url":"https://github.com/nokia/regexp-learner","last_synced_at":"2025-06-25T10:39:02.088Z","repository":{"id":92206471,"uuid":"193736112","full_name":"nokia/regexp-learner","owner":"nokia","description":"A python module allowing to learn patterns by issuing queries and learning from counter examples.","archived":false,"fork":false,"pushed_at":"2025-05-27T14:32:03.000Z","size":796,"stargazers_count":8,"open_issues_count":0,"forks_count":1,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-05-27T14:57:12.495Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"bsd-3-clause","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/nokia.png","metadata":{"files":{"readme":"README.md","changelog":"HISTORY.md","contributing":"CONTRIBUTING.md","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":"AUTHORS.md","dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2019-06-25T15:35:40.000Z","updated_at":"2025-05-27T14:33:50.000Z","dependencies_parsed_at":"2025-05-20T22:02:02.866Z","dependency_job_id":null,"html_url":"https://github.com/nokia/regexp-learner","commit_stats":null,"previous_names":[],"tags_count":1,"template":false,"template_full_name":null,"purl":"pkg:github/nokia/regexp-learner","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nokia%2Fregexp-learner","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nokia%2Fregexp-learner/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nokia%2Fregexp-learner/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nokia%2Fregexp-learner/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/nokia","download_url":"https://codeload.github.com/nokia/regexp-learner/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/nokia%2Fregexp-learner/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":261853329,"owners_count":23219844,"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":[],"created_at":"2024-12-02T23:10:22.415Z","updated_at":"2025-06-25T10:39:02.058Z","avatar_url":"https://github.com/nokia.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# regexp-learner\n\n[![PyPI](https://img.shields.io/pypi/v/regexp_learner.svg)](https://pypi.python.org/pypi/regexp_learner/)\n[![Build](https://github.com/nokia/regexp-learner/workflows/build/badge.svg)](https://github.com/nokia/regexp-learner/actions/workflows/build.yml)\n[![Documentation](https://github.com/nokia/regexp-learner/workflows/docs/badge.svg)](https://github.com/nokia/regexp-learner/actions/workflows/docs.yml)\n[![ReadTheDocs](https://readthedocs.org/projects/regexp-learner/badge/?version=latest)](https://regexp-learner.readthedocs.io/en/latest/?badge=latest)\n[![codecov](https://codecov.io/gh/nokia/regexp-learner/branch/master/graph/badge.svg?token=OZM4J0Y2VL)](https://codecov.io/gh/nokia/regexp-learner)\n\n## Overview\n\n[regexp-learner](https://github.com/nokia/regexp-learner) is a [Python 3](http://python.org/) module providing the following algorithms:\n* __Angluin (1987):__ the L* algorithm is presented in _Learning regular sets from queries and couterexamples_, Dana Angluin, 1987 [[pdf](https://people.eecs.berkeley.edu/~dawnsong/teaching/s10/papers/angluin87.pdf)], [[slides](https://github.com/nokia/regexp-learner/blob/master/Angluin.pdf)].\n* __Gold (1978):__ the Gold algorithm is presented in _Complexity of automaton identification from given data_, E. Mark Gold, 1987 [[pdf](http://sebastian.doc.gold.ac.uk/papers/Language_Learning/gold78complexity.pdf)].\n\nThis module is built on top of:\n* [numpy](https://pypi.org/project/numpy/);\n* [pybgl](https://pypi.org/project/pybgl/), a lightweight graph library.\n\nA [jupyter notebook](https://pypi.org/project/jupyter/) is also provided test the algorithm. Note that the [graphviz](https://pypi.org/project/jupyter/) runnables (e.g., `dot`) is required to display the automata.\n\n## Usage\n\n* Install [Jupyter Notebook](https://pypi.org/project/jupyter/) or [Jupyter lab](https://pypi.org/project/jupyterlab/).\n* Follow [installation steps](https://github.com/nokia/regexp-learner/wiki/Installation).\n* Run `jupyter notebook` or `jupyter lab`.\n* Open the desired notebook.\n* Run the cells.\n\n## Links\n\n* [Installation](https://github.com/nokia/regexp-learner/blob/master/docs/installation.md)\n* [Documentation](https://regexp-learner.readthedocs.io/en/latest/)\n* [Coverage](https://app.codecov.io/gh/nokia/regexp-learner)\n* [Wiki](https://github.com/nokia/regexp-learner/wiki)\n\n## License\n\nThis project is licensed under the [BSD-3-Clause license](https://github.com/nokia/regexp-learner/blob/master/LICENSE).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnokia%2Fregexp-learner","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fnokia%2Fregexp-learner","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fnokia%2Fregexp-learner/lists"}