{'fraction_non_alphanumeric': 0.011320754716981131, 'fraction_numerical': 0.0, 'mean_word_length': 5.6375, '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}}
A Class of Distance Functions with Rearranging Techniques

In this paper, a class of distance functions are proposed to appropriately measure the distance between the vectors. First we build an elementary inequality, based on which we introduce the new distance functions combining some classic vector norms with the rearranging techniques. These distance functions could be helpful in eigenvalue computation or other scientific computations. Some basic and interesting properties of the involved distance functions are discussed.