{'fraction_non_alphanumeric': 0.011869436201780416, 'fraction_numerical': 0.0, 'mean_word_length': 4.6722689075630255, '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}}
An Efficient Semantic Similarity Search on XML Documents

In this paper, we study the use of XML path query to search an XML fragment in a collection of XML documents. We present efficient techniques that are able to employ bit-slice bloom-filtered signature file as filter and investigate an approach that are able to measure semantic similarity between the query and the XML document in the collection by considering their structures and contents. A ranked list of XML fragments is generated as the search results. By using a set of path queries on a variety of XML documents, the experiments show that the precision and efficiency of the results perform better than ever.