{'fraction_non_alphanumeric': 0.009668508287292817, 'fraction_numerical': 0.0, 'mean_word_length': 5.25, '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}}
Simple method based on complexity for authorship detection of text

Authorship-identification is an actual research area with different applications. Particularly it is a question if only highly specialised and well equipped entities could identify an author or it could be made by broader community via exploiting text. In order to shed light on this question a very simple and computationally not demanding method for author identification was proposed based on lossless compression algorithms. In this paper another such method based on complexity is proposed and its verification on real data is presented. Results of experiments proved, that also such a simple method could be used successful identification of authors.