{'fraction_non_alphanumeric': 0.028622540250447227, 'fraction_numerical': 0.0, 'mean_word_length': 4.894736842105263, '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}}
One-Scan KeyGraph Implementation

KeyGraph proposed by Y. Ohsawa is a visual method for document-indexing and chance discovery. Originally, it dealt with the static text data, and recently used in the process of chance discovery interactively. When data is large or users’ demands change constantly, a flexible and efficient algorithm is necessary to avoid reprocessing the input data. In this paper, we propose a one-scan KeyGraph implementation scheme. This scheme reduces I/O time by only one scan of data, and simplifies processing by data transformation.