<commit_before># Grime

## Introduction

Grime is based on conjunctive grammars.
The basic idea is to construct rectangular patterns from smaller components, and check whether they are found in the input matrix.

## Usage

A Grime program is called  a _grammar_, and the correct file extension for a grammar is `.gr`, although this is not enforced.
The program is called like

    runhaskell grime.hs [options] grammarfile matrixfile

where `matrixfile` is a file containing the character matrix.
For example, the digits program would be called like

    runhaskell grime.hs digits.gr digit-matrix
<commit_msg>Updated README.<commit_after># Grime

## Introduction

Grime is a two-dimensional pattern matching language based on Boolean grammars.
The basic idea is to construct rectangular patterns from smaller components, and check whether they are found in the input matrix.

## Usage

A Grime program is called  a _grammar_, and the correct file extension for a grammar is `.gr`, although this is not enforced.
The program is called like

    runhaskell grime.hs [options] grammarfile matrixfile

where `matrixfile` is a file containing the character matrix.
For example, the digits program would be called like

    runhaskell grime.hs digits.gr digit-matrix

{'fraction_non_alphanumeric': 0.044374009508716325, 'fraction_numerical': 0.0, 'mean_word_length': 4.420600858369099, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '156331', 'n_tokens_mistral': 338, 'n_tokens_neox': 314, 'n_words': 176}