{'fraction_non_alphanumeric': 0.022189349112426034, 'fraction_numerical': 0.0, 'mean_word_length': 5.099099099099099, '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}}
Constraint-Based Approach to Semistructured Data

In this paper we consider how constraint-based technology can be used to query semistruc-tured data. As many concerns in semistructured data (e.g., representing and retrieving) are also found in computational linguistics, this last area could provide an interesting angle to attack some of the problems regarding semistructured data. We present a formalism based on feature logics for query-ing semistructured data. The formalism is a hybrid one in the sense that it combines clauses with path constraints. The resulting language has a clear declarative and operational semantics based on the notion of extended active domain.