{'fraction_non_alphanumeric': 0.015637860082304528, 'fraction_numerical': 0.0, 'mean_word_length': 4.874396135265701, '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}}
Reconstruction of the Relevant Information Tree for an Object

Every thing has more information or details hidden in the back than its looks. In this research, we focus on objects gathered on the Net, and our aim is the reconstruction of the tree of relevant information associated with them. For such objects, there are a lot of relevant information dispersed and stored somewhere on the Net, but it is not easy to retrieve such highly distributed information as a chain of related information.. In order to deal with such drawbacks, our approach is as follows. we extract automatically relevant keywords from the results of the first information retrieval, make the new query with such extracted keywords and do the search again. This process is repeated, and finally a knowledge tree of associated relevant information is constructed In this paper, we take as example the search of information associated with books. When the user search for a particular book, our system shows as complementary information the URL of related information recommended by other users in previous search for the same book title. Thus, our system automatically finds a query and searches the relevant information for a given subject.