<commit_before>Schemata
========

|PyPI version| |License| |Supported Python| |Format| |Downloads|

Schemata is a simple Python package to do all things related to schemata_.

A schema is word made using an extra symbol, '*', called the wild card symbol.
For example the schema over the binary aplhapbet '1*0', represents the set of
strings. {'100','110'}'.

Schema have properties. For example, for a schema s, the order of s is the
number of symbols in s which are not the wild card symbols (called fixed symbols).
The defining length of s is the distance between the first and last fixed symbol.  

Given a set of words of the same length S, the schematic completion of S
returns all schemata which can make the words in S. 
Whats more given the partial ordering over schemata, the schematic completion of S
forms a `Complete Lattice'_      


Links
-----

- GitHub:https://github.com/iSTB/python-schemata
- PyPI: http://pypi.python.org/pypi/concepts
- Documentation: http://concepts.readthedocs.org
- Changelog: http://concepts.readthedocs.org/en/latest/changelog.html
- Issue Tracker: https://github.com/iSTB/python-schemata/issues
- Download: http://pypi.python.org/pypi/concepts#downloads


Installation
------------

This package runs under Python 2.7 and 3.3+, use pip_ to install:

.. code:: bash

    $ pip install concepts

This will also install the bitsets_ and graphviz_ packages from PyPI as
required dependencies.<commit_msg>read me stuff<commit_after>Schemata
========

|PyPI version| |License| |Supported Python| |Format| |Downloads|

Schemata is a simple Python package to do all things related to schemata_.

A schema is word made using an extra symbol, '*', called the wild card symbol.
For example the schema over the binary aplhapbet '1*0', represents the set of
strings. {'100','110'}'.

Schema have properties. For example, for a schema s, the order of s is the
number of symbols in s which are not the wild card symbols (called fixed symbols).
The defining length of s is the distance between the first and last fixed symbol.  

Given a set of words of the same length S, the schematic completion of S
returns all schemata which can make the words in S. 
Whats more given the partial ordering over schemata, the schematic completion of S
forms a `Complete Lattice`_      


Links
-----

- GitHub:https://github.com/iSTB/python-schemata
- PyPI: http://pypi.python.org/pypi/concepts
- Documentation: http://concepts.readthedocs.org
- Changelog: http://concepts.readthedocs.org/en/latest/changelog.html
- Issue Tracker: https://github.com/iSTB/python-schemata/issues
- Download: http://pypi.python.org/pypi/concepts#downloads


Installation
------------

This package runs under Python 2.7 and 3.3+, use pip_ to install:

.. code:: bash

    $ pip install concepts

This will also install the bitsets_ and graphviz_ packages from PyPI as
required dependencies.
{'fraction_non_alphanumeric': 0.0957004160887656, 'fraction_numerical': 0.008321775312066574, 'mean_word_length': 3.898132427843803, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 4, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 6, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1712192', 'n_tokens_mistral': 885, 'n_tokens_neox': 822, 'n_words': 365}