{'fraction_non_alphanumeric': 0.037037037037037035, 'fraction_numerical': 0.04938271604938271, 'mean_word_length': 5.809160305343512, '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}}
An information-theoretic approach to assess linguistic complexity

Linguistic complexity is one of the currently most hotly debated notions in linguistics. The long-standing assumption that all languages are of equal complexity (Bickerton 1995; Crystal 1987; Edwards 1994; Hockett 1958; O’Grady, Dobrovolsky, and Aronoff 1997) had remained unchallenged for much of the twentieth century. Recently, however, this dogma has been questioned and scrutinized (Kusters 2003; McWhorter 2001), and the notion of linguistic complexity has received a considerable amount of interest (Dahl 2004; Kortmann and Szmrecsanyi 2012; Miestamo, Sinnemäki, and Karlsson 2008; Sampson, Gil, and Trudgill 2009). Two central issues in the linguistic complexity debate are, firstly, the problem of finding a generally applicable definition of what exactly complexity is and secondly, how to measure this complexity.