{'fraction_non_alphanumeric': 0.018867924528301886, 'fraction_numerical': 0.0, 'mean_word_length': 5.3478260869565215, '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}}
Fast floating point vectoring algorithms and performance evaluation

In this paper, we briefly introduce our previous work-the formalization of fast rotation-based vectorization algorithms-and show how to obtain key parameters such as window size for the implementation by extensive simulation. We also show that, if the angle selection techniques presented in this paper are used in an approximate rotation setup, such as in a Jacobi based eigenvalue decomposition (EVD) algorithm, we can profit from the fact that the average latency of the vectoring unit is significantly reduced.