The paper reports the authors’ submission to KnowledgeGraphEval 2026 Subtask 2 on directed Arabic relation extraction. They evaluated both encoder‑based models—using typed entity markers and separate relation‑existence and relation‑classification heads—and large language model approaches, fine‑tuning Yehia and Qwen3.5 with QLoRA under ontology‑constrained prediction. Their ensemble of Yehia‑RE, Qwen‑RE, and TypedPair achieved a micro‑F1 of 94.06, securing first place in the subtask.
arXiv:2610.22542v1 Announce Type: cross Abstract: While LLMs demonstrate strong capabilities in English Relation Extraction (RE) tasks, a significant gap remains in assessing their RE performance in...
E-CONAN introduces Arabic textual entailment and natural inference benchmarks comprising two datasets: E-CONAN-2 (2-way RTE) and E-CONAN-3 (3-way NLI). The datasets are built from automatically-translated pairs, human-validated machine translations, hand-crafted pairs from Arabic teaching books, and rumor-containing news headlines. The authors evaluated nine multilingual pretrained models and five large language models on these benchmarks, demonstrating that E-CONAN offers a more diverse and robust assessment than existing datasets like XNLI and ArNLI.
arXiv:2608. 13580v1 Announce Type: cross Abstract: Jais 2 is a family of Arabic-centric large language models developed jointly by MBZUAI, Cerebras, and Inception, designed to advance Arabic-centric language modeling, with strong performance across the Arabic and culturally grounded benchmarks evaluated in this report.
arXiv:2606. 29860v1 Announce Type: new Abstract: Knowledge graphs (KGs) organize real-world knowledge as triplets and underpin many downstream applications.
arXiv:2606. 26986v1 Announce Type: cross Abstract: Open Relation Extraction (OpenRE) requires a model to extract unseen relations between head and tail entities from unstructured text for real-world applications.
arXiv:2506.05626v3 Announce Type: replace Abstract: Real-world knowledge can take various forms, including structured, semi-structured, and unstructured data. Among these, Knowledge Graphs (KGs) are...
arXiv:2610.26952v1 Announce Type: new Abstract: Relational triple extraction identifies entity relations from raw sentences without depending on entity type information. The performance of traditiona...
The paper presents an end‑to‑end pipeline for automatically constructing a tree‑structured knowledge graph (KG) from Vietnamese high school history textbooks and evaluating retrieval strategies that exploit the KG’s hierarchical structure. The KG construction uses a three‑phase hybrid relation extraction process, including intra‑batch deduplication, approximate cross‑batch search, and LLM extraction with a centroid filter and dual‑LLM validator, resulting in 750 nodes and 4,341 semantic edges across 41 ontology types. Retrieval evaluation compares three graph traversal strategies—Top‑Down, Horizontal, and Bottom‑Up—on a benchmark of 1,210 Vietnamese queries, finding that the Top‑Down strategy with structural information outperforms a vector baseline by 4.7 percentage points in NDCG@10.
arXiv:2511.04473v3 Announce Type: replace Abstract: Retrieval of information from graph-structured knowledge bases represents a promising direction for improving the factuality of LLMs. While various...
This paper proposed an algorithm for part-of-speech (POS) tagging senses of a bilingual dictionary. The algorithm is applied on the Al-Mawrid Arabic-English dictionary.
The paper evaluates large pre‑trained language models (LLMs) for knowledge entity relation extraction (KERE) from academic articles, comparing multiple strategies such as closed‑source LLM CoT prompting, LoRA‑adapted open‑source LLMs, and various LLM‑enhanced small pre‑trained language models (SLMs). Two manually annotated datasets in the NLP domain—one for abstracts and one for full texts—were used, and the LoRA‑adapted T5 model achieved the highest macro F1 scores (0.7408 for abstracts and 0.7013 for full texts). Error analysis shows that LLM‑based strategies mitigate SLM errors differently across error types, and combining complementary strategies further improves KERE performance.
arXiv:2601. 15037v2 Announce Type: replace-cross Abstract: Open-domain Relational Triplet Extraction (ORTE) aims to mine structured knowledge without predefined relation schemas.