{'fraction_non_alphanumeric': 0.023429179978700747, 'fraction_numerical': 0.004259850905218318, 'mean_word_length': 5.962962962962963, '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}}
Managing inconsistent repositories via prioritized repairs

Whenever a group of authors collaboratively edits interrelated documents semantic consistency is a major goal. Current document management systems (DMS) lack adequate consistency management facilities. We propose liberal use of formal consistency rules which permits inconsistencies. In this paper we focus on deriving repairs for inconsistencies. Our major contributions are: (1) deriving (common) repairs for multiple rules (2) resolving conflicts between repairs (3)prioritizing repairs and (4) support for partial inconsistency resolution which resolves the most troubling inconsistencies and leaves less important inconsistencies for a later handling. The novel aspect of our approach is that we derive repairs from DAGs (directed acyclic graphs) and not from documents directly. That way the repository is locked during DAG generation only which is performed incrementally.