{'fraction_non_alphanumeric': 0.010526315789473684, 'fraction_numerical': 0.0, 'mean_word_length': 4.893805309734513, '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}}
Linear Grammars with Labels

The purpose of the paper is to show that we can work in the spirit of Minimalist Grammars by means of an unirected deductive system called LGE, enhanced with constraints on the use of assumptions. Lexical entries can be linked to sequences of controlled hypotheses which represent intermediary sites. The assumptions must be introduced in the derivation and then discharged in tandem by their proper entry which will therefore manage to find its final position: this allows to logically simulate move operation. Relevance of this formalism is stressed by showing its ability to give a compositional semantics in the line of R. Montague.