An Algorithm for Finding Equivalence in Referential Relations

2023

Closed access Metadata (CSL-JSON)
DOI 10.7753/ijcatr1204.1009
Data confidence 70 medium
How this score is calculated

It is built from checkable properties of the record itself: whether the article has a DOI, how many independent sources confirmed its data, whether the required fields are filled in, and how recent the latest confirmation is. Disagreement between sources and a missing identifier lower it. A value of 80 or above means the record was published without further checking; 60 to 79 means it is published at reduced confidence, with a manual check advisable. A record verified by an editor by hand is never pushed below 90 by a recalculation. This scores our data about the article, not the article itself.

Abstract

Establishing referential relations in discourse is one of the most relevant but difficult to model problems of automatic text analysis. Reference means attributing a textual unit (linguistic expression) to a non-linguistic object (referent). The correct interpretation of the statement in the analyzed text requires solving the referent of the textual reference about the object, that is, the reference of the textual expression. In this work, a model for resolving referential relations is proposed. The method used to solve the referential relationship is finding equivalence, that is, by calculating the degree of similarity of possible elements in the word, the similarity in the referential relationship is calculated, and as a result, the relationship value of the referent in the sequence of sentences is obtained. These opportunities will be a new beginning for solving referential relationships in the Kazakh language. Based on the possibilities of computer technology, this direction in developing language education creates a great opportunity for extensive research and analysis at various levels of the language treasure as a bright mirror of the spiritual and material culture of the people.