SEMANTIC GRAPH KNOWLEDGE REPRESENTATION FOR AL-QURAN VERSES BASED ON WORD DEPENDENCIES

نویسندگان

چکیده

Semantic approaches present an efficient, detailed and easily understandable representation of knowledge from documents. Al-Quran contains a vast amount that needs appropriate extraction. A semantic based approach can help in designing efficient explainable model for Al-Quran. This research aims to propose semantic-graph verses on word dependencies. These features are used the proposed allowing graph matching improve search applications' accuracy. The is essentially formalism generating Quranic verses, which be applied base construction other applications such as information retrieval system. set rules called Dependency Triple Rules defined mapped into representing verse's logic. translate dependencies NLP metadata triple form holds logical information. has been tested with English translation document prototype basic system enhanced anaphoric pronouns correction, shown improvement performance. results have compared closely related evaluated accuracy Precision, Recall F-score measurements. achieved 65%, 60% 62.4% measurements, respectively. It also improved overall previous by 43.8%.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Knowledge representation using semantic network for female related issues from the Holy Quran

Focusing on the use of semantic network representation, this paper presents an easy way in understanding concepts discussed in the Holy Quran. The Quran is known as the main source of knowledge and has been a major source reference for all types of problems. However, understanding the issues and the solution from the Quran is difficult due to lack of understanding of the Quran literature. The Q...

متن کامل

On Semantic Word Cloud Representation

We study the problem of computing semantic-preserving word clouds in which semantically related words are close to each other. While several heuristic approaches have been described in the literature, we formalize the underlying geometric algorithm problem: Word Rectangle Adjacency Contact (WRAC). In this model each word is a rectangle with fixed dimensions, and the goal is to represent semanti...

متن کامل

Graph-Based Formalisms for Knowledge Representation

Graph-based formalisms provide an intuitive and easily understandable vehicle for knowledge representation. In this paper several existing graph-based formalisms are described. Furthermore, a new graph-based formalism for knowledge representation is defined. Basic concepts for graphical representation (nodes and links) as well as their variation are described. Context node, context link and pro...

متن کامل

The Semantics of the Word Istikbar (Arrogance) in the Holy Quran based on Syntagmatic Relations(A Case Study of Semantic Proximity and Semantic Contrast)

The word istikbar (arrogance) is one of the key words in the monotheistic system of the Quran, which has found a special status as a special feature of the opponents and adversaries of the call to the truth. Given the prominent role of this issue in the human life system and its provision of corruption and moral deviations, it is necessary to represent the nature of the elements that make up th...

متن کامل

Word sense ranking based on semantic similarity and graph entropy

In this paper we propose a system for the recommendation of tagged pictures obtained from the Web. The system, driven by user feedback, executes an abductive reasoning (based on WordNet synset semantic relations) that is able to iteratively lead to new concepts which progressively represent the cognitive creative user state. Furthermore we design a selection mechanism to pick the most relevant ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Malaysian Journal of Computer Science

سال: 2021

ISSN: ['0127-9084']

DOI: https://doi.org/10.22452/mjcs.sp2021no2.9