{'fraction_non_alphanumeric': 0.016282225237449117, 'fraction_numerical': 0.0, 'mean_word_length': 5.709090909090909, '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}}
A Non-Generative Constraint-Based Formalism

Most modern linguistic theories rely on the notion of constraints. However, very few applications try to implement the parsing process directly with constraint programming: in most cases, constraints are interpreted in a passive sense, the parsing process itself being no different from that of classical derivational approaches. We show in this paper that the problem comes from the representation of linguistic information and the generative interpretation of the relation between grammar and language. We propose a new approach, called Property Grammar in which all syntactic information is represented with constraints, the parsing process being an actual constraint resolution mechanism.