{'fraction_non_alphanumeric': 0.017382413087934562, 'fraction_numerical': 0.0010224948875255625, 'mean_word_length': 5.235668789808917, '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 Method of Eliminating Direct Super-Class to Detect Cycle of Concepts

Ontology has gained broad attention within the knowledge engineering community and their related application domain in recent years. Ontology is an explicit formal sharing conceptualization of one domain. Ontology maintenance is one of most important work during ontology’s development lifecycle. Cycle of concepts is one of the most common inconsistency errors in ontology. In this paper, we propose a method of eliminating direct super-class to detect cycle of concepts (EDS2DCC).This method firstly constructs oriented graphs according to the system of concepts in ontology. Secondly, it defines an array to store concepts access states and a table to store current concepts list, then the method determines whether existing cycle of concepts or not based on the length which obtained from periodic oriented graphs. Finally, we demonstrate the validity of the method by applying and analyzing scenarios.