{'fraction_non_alphanumeric': 0.008138351983723296, 'fraction_numerical': 0.0, 'mean_word_length': 5.648648648648648, '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}}
Interactive Query Hierarchy Generation Algorithms for Search Result Visualization

This paper presents an anticipatory user interface for search result visualization that exploits Query Lookahead, a technique that eagerly evaluates refined queries automatically generated from an initial user query. A selected collection of refined queries is displayed to the user as an Interactive Query Hierarchy. Each child query refines its parent with additional indexing terms that are extracted from the documents that match the parent query. The user interface presents the results of each selected child query in advance. Interactive query hierarchies can also break down a large and imprecise result set in categories determined by the indexing terms appearing in the documents in the result set. The availability of search results from query lookahead make possible the development of coverage-based category selection algorithms that maximize coverage while minimizing information loss.