{'fraction_non_alphanumeric': 0.02058319039451115, 'fraction_numerical': 0.0, 'mean_word_length': 5.561797752808989, '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}}
Continuous boundary local Fourier transform

The Local Fourier Transform (LFT) provides a nice tool for concentrating both a signal and its Fourier transform. But there are certain properties of this algorithm that make it unattractive for various applications. In this paper, some of these disadvantages are explored, and a new approach to localized Fourier analysis is proposed, the continuous boundary local Fourier transform (CBLFT), which attempts to correct some of these shortcomings. Results ranging from segmentation to representation cost to compression are also presented.