{'fraction_non_alphanumeric': 0.019230769230769232, 'fraction_numerical': 0.0, 'mean_word_length': 5.0761421319796955, '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}}
Relation Extraction Based on Relation Label Constraints

Knowledge graphs have a significant role in promoting natural language processing tasks, and they have received substantial attention. The relation extractor is a key step in the construction of a knowledge graph, so it is important to improve its performance. However, previous works are mainly based on the pipeline method, which rarely address the problem of overlapping triplets. In addition, the literature does not consider models in which the correlation between relation pairs is addressed, which limits their accuracy. In this paper, we propose a new model called Relation Extraction Based On Relation Label Constraints(RRC) that is based on relation matrix constraints. The subject is extracted in our model in the first step; then, the relation and object are extracted based on the subject information. Each relation is regarded as a vector to assist in the extraction of the relation and object; the vector is used to consider the correlation between the relation vectors. This is used as a constraint to optimize the relation vector. Experiments on two public datasets, NYT and WebNLG, show that this method can perform well.