{'fraction_non_alphanumeric': 0.021359223300970873, 'fraction_numerical': 0.0, 'mean_word_length': 4.931034482758621, '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}}
Comparison-based search in the presence of errors

The classic problem of searching an ordered list becomes more complicated when the answers to queries are not reliable. In the prefix-bounded error model, the number of incorrect responses at no point exceeds r times the number of questions, where r is a fixed positive fraction strictly less than ~. We present efficient algorithms for searching in this error model, and we also establish nontrivial lower bounds for sorting, maxima finding, and related problems.