{'fraction_non_alphanumeric': 0.01899441340782123, 'fraction_numerical': 0.0, 'mean_word_length': 5.136986301369863, '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}}
Fast computation of query relaxations for knowledge-based recommenders

“No matching product found” is an undesirable message for the user of an online product finder application or interactive recommender system. Query Relaxation is an approach to recovery from such retrieval failures and works by eliminating individual parts of the original query in order to find products that satisfy as many of the user's constraints as possible. 
 
In this paper, new techniques for the fast computation of “user-optimal” query relaxations are proposed. We show how the number of costly catalog queries can be minimized with the help of a query pre-processing approach, how we can compute relaxations that contain at least n items in the recommendation, and finally, how a recent conflict-detection algorithm can be applied for fast determination of preferred conflicts in interactive recovery scenarios.