{'fraction_non_alphanumeric': 0.021645021645021644, 'fraction_numerical': 0.0, 'mean_word_length': 5.52112676056338, '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}}
Polynomial-time solution of change detection problems

Change detection problems are ubiquitous, but there are no existing tractable techniques for e-exact solution of discrete-time, discrete-observation problems. A polynomial-time algorithm for solution of Markov Bayes change detection problems is presented. The algorithm combines backward induction on a tree with induction of bounds on the value function at specific points from those of neighboring points.