{'fraction_non_alphanumeric': 0.02120141342756184, 'fraction_numerical': 0.0, 'mean_word_length': 5.517241379310345, '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}}
Performance of the deskewed short-time correlator

A technique is described for time-delay estimation of linearly varying time delay using coherent processing of short-time correlograms. Results of a computer simulation of this technique are compared to analytical predictions and theoretical bounds, in terms of output signal/noise ratio and estimation accuracy. The deskewed short-time correlator is seen to provide near-optimal performance, implementational simplicity, and little sensitivity to the number of short time segments into which the data is segmented.