{'fraction_non_alphanumeric': 0.03364485981308411, 'fraction_numerical': 0.0, 'mean_word_length': 4.203883495145631, '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}}
KLP Not Always Efficient

The size of the nondominated set of a vector set is greatly dependent on the size of the original vector set N and the dimension of the vector M . Theoretical analysis shows that when M = O(log N) the original set has big nondominated set which may be the original set itself, and in the case M = O(log N), a classical algorithm (KLP) for finding nondominated set has complexity of KLP higher than N. Experiment verifies the analysis result as well. Therefore, we should avoid employing KLP when M = O(log N).