{'fraction_non_alphanumeric': 0.02664796633941094, 'fraction_numerical': 0.008415147265077139, 'mean_word_length': 5.102564102564102, '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}}
Chapter 4 Parsing Complexity and Model-Theoretic Syntax

As a primarily declarative approach, model theoretic syntax focuses the manner we formalize and describe the syntax of natural languages. However, in practice, we often make the experience that such formalisms suffer from excessive complexity. Depending on the underlying logical formalism, the complexity of proving the validity or satisfiability of a given (set of) formula(e) is typically EXPTIME complete or beyond. On the other hand, the parsing complexity of context-free languages is well-known to be in cubic time with regard to the length of the input word and quadratic time with regard to the size of the underlying grammar(see Younger, 1967). 1