{'fraction_non_alphanumeric': 0.012429378531073447, 'fraction_numerical': 0.0, 'mean_word_length': 5.514705882352941, '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}}
Predicting the cumulative effect of multiple query formulations

Multiple query formulations (MQF) have been extensively explored and when used, provide considerable improvements in quality of information retrieval on the Web. However, the question of how to formulate a variety of distinctive queries and how many queries are needed in each unique case remains essentially unanswered. In this research we present a process for selecting search terms and formulating multiple short queries from the original long query. We introduce a scaled cumulative query weight (t) function which is based exclusively on the submitted long query. We demonstrate that this function can serve as a predictive variable for the effectiveness of various multiple query formulation methods and can be used algorithmically to determine the operational parameters for a multiple query formulation process.