{'fraction_non_alphanumeric': 0.010355029585798817, 'fraction_numerical': 0.0, 'mean_word_length': 5.386792452830188, '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}}
A look-ahead strategy for graph matching in retrieval by spatial arrangement

Image retrieval by spatial arrangement underlies a matching problem for the interpretation of entities specified in the user query on the entities appearing in the image of the database, and for the joint comparison of their features and spatial relationships. We provide a graph-theoretical formulation and discuss the size of the problem of spatial matching as encountered in the specific application context of retrieval by visual content. We then expound and evaluate an original state-space search algorithm which supports efficient comparison of models through an heuristic bounding approach.