{'fraction_non_alphanumeric': 0.021505376344086023, 'fraction_numerical': 0.025806451612903226, 'mean_word_length': 5.213333333333333, '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 connection between the Baum-Welch algorithm and turbo decoding

It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch (1966, 1968, 1970) algorithm provide solutions to these problems, including solutions that duplicate the forward-backward and turbo decoding algorithms.