تستخدم الرسوم البيانية المعرفة (KGS) على نطاق واسع لتخزين المعلومات والوصول إليها حول الكيانات وعلاقاتها.بالنظر إلى استفسار، تهدف مهمة استرجاع الكيانات من KG إلى تقديم قائمة في المرتبة ذات الصلة بالاستعلام.في الآونة الأخيرة، أظهر عدد متزايد من النماذج لاسترجاع الكيان تحسنا كبيرا على الأساليب التقليدية.هذه النماذج، ومع ذلك، تم تطويرها للكلية الإنجليزية.في هذا العمل، نبني على نظام واحد من هذا القبيل، يدعى Kewer، لاقتراح Serag (استرجاع الكيانات الدلالي من الرسوم البيانية المعرفة العربية).مثل Kewer، يستخدم Serag مناحي عشوائي لتوليد embeddings للكياء.تعتبر DBPedia-Entity V2 مجموعة الاختبار القياسية لاسترجاع الكيان.نناقش تحديات استخدامها للغات غير الإنجليزية بشكل عام والعربية على وجه الخصوص.نحن نقدم نسخة عربية من هذه المجموعة القياسية، واستخدامها لتقييم Serag.يظهر Serag أنه يتفوق بشكل كبير على نموذج BM25 الشهير بفضل التفكير المتعدد القفز.
Knowledge graphs (KGs) are widely used to store and access information about entities and their relationships. Given a query, the task of entity retrieval from a KG aims at presenting a ranked list of entities relevant to the query. Lately, an increasing number of models for entity retrieval have shown a significant improvement over traditional methods. These models, however, were developed for English KGs. In this work, we build on one such system, named KEWER, to propose SERAG (Semantic Entity Retrieval from Arabic knowledge Graphs). Like KEWER, SERAG uses random walks to generate entity embeddings. DBpedia-Entity v2 is considered the standard test collection for entity retrieval. We discuss the challenges of using it for non-English languages in general and Arabic in particular. We provide an Arabic version of this standard collection, and use it to evaluate SERAG. SERAG is shown to significantly outperform the popular BM25 model thanks to its multi-hop reasoning.
References used
https://aclanthology.org/
Text generation from semantic graphs is traditionally performed with deterministic methods, which generate a unique description given an input graph. However, the generation problem admits a range of acceptable textual outputs, exhibiting lexical, sy
Knowledge graph entity typing aims to infer entities' missing types in knowledge graphs which is an important but under-explored issue. This paper proposes a novel method for this task by utilizing entities' contextual information. Specifically, we d
Knowledge Graphs (KGs) have become increasingly popular in the recent years. However, as knowledge constantly grows and changes, it is inevitable to extend existing KGs with entities that emerged or became relevant to the scope of the KG after its cr
The design of expressive representations of entities and relations in a knowledge graph is an important endeavor. While many of the existing approaches have primarily focused on learning from relational patterns and structural information, the intrin
Semantic Web is a new revolution in the world of the Web, where information and
data become viable for logical processing by computer programs. Where they are
transformed into meaningful data network. Although Semantic Web is considered the
future