{'fraction_non_alphanumeric': 0.021321961620469083, 'fraction_numerical': 0.008528784648187633, 'mean_word_length': 5.266666666666667, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, '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}}
More Flexible Term Schematisations via Extended Primal Grammars

We propose an extension of primal grammars (Hermann & Galbavý 1997). Primal grammars are term grammars with a high expressive power and good computational properties. The extended grammars have exactly the same properties but are more modular, more concise, and easier to use, as shown by some examples. An algorithm transforming any extended primal grammar into an equivalent primal grammar is provided.