{'fraction_non_alphanumeric': 0.013986013986013986, 'fraction_numerical': 0.0, 'mean_word_length': 5.095744680851064, '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}}
Compressing an inverted file with LCS

The document index construction is one of the most important concerns in designing an information retrieval system. The most common index structure used in document retrieval is the inverted file, which consists of inverted lists holding lists of pointers to all the locations of the given terms in the documents collected. The size of an inverted file can be reduced by the use of compression techniques. We exploit randomized minimum spanning tree (MST) algorithm, which uses the spanning tree verification and randomized sampling.