Aug 2026· Journal of King Saud University: Computer and Information Sciences· Vol 38· 0 citations· 48 references
TL;DR
The Holy Quran Digital Repository (HQDR), which spans chapters to characters and retains all 84 graphemes of the Hafs ‘an ‘Asim edition, including Uthmanic and Tajweed marks, and the Holy Quran Pattern Search (HQPS) engine, which supports boundary-aware regular-expression queries directly over this representation.
Abstract
Existing digital Quran repositories support verse-level access, but few preserve the complete chapter-to-character decomposition and the full grapheme inventory of Mushaf Al-Madinah within a single integrated relational schema. We address this gap with the Holy Quran Digital Repository (HQDR), which spans chapters to characters and retains all 84 graphemes of the Hafs ‘an ‘Asim edition, including Uthmanic and Tajweed marks. Built on HQDR, the Holy Quran Pattern Search (HQPS) engine supports boundary-aware regular-expression queries directly over this representation. To make these queries accessible to non-technical users, a Model Context Protocol layer lets Large Language Models translate natural-language requests into expert-validated patterns that HQPS executes deterministically. We evaluate the system along two complementary axes. On a keyword-retrieval benchmark, HQPS achieves exact-match accuracy on every query, against 70% for Tanzil and 20–40% verse-level accuracy for KFGQPC and Alfanous (2024). As a domain-specific correctness validation—rather than a general information-retrieval benchmark—exhaustive extraction across five Tajweed rule families returns 45,460 instances, validated by three certified experts with 100% precision on four families and 99.98% on Lam Qamariyyah.
TQTS-BENCH is introduced, a multi-syntax benchmark for evaluating text-to-query capabilities over TSDBs, and error analysis reveals that this performance gap mainly stems from the heterogeneous query syntaxes across different TSDBs, misinterpretation of time-specific intents, and incorrect schema linking.
Fei Lyu, Zhi-Yi Peng, Jia-Ming Liu et al.· 0 citations
It is suggested that, in dense-urban POI settings where coordinates are reliable, the marginal benefit of explicit graph edges shrinks for coordinate-computable relationships, while structured spatial processing complements vector retrieval.
Noboru Otsuka· The International Archives o...· 0 citations
Text-to-SQL research has concentrated on English, while prior work on Arabic, Japanese, and Vietnamese has largely relied on grammar-constrained parsers or zero-shot prompting, with recent work beginning to explore trained LLM-based alternatives. We investigate whether a unified fine-tuned open-source pipeline can serv...
This survey presents a systematic review of 121 references spanning 2002 to 2026, tracing the evolution of TextRank-based approaches into hybrid LLM pipelines and advancing three qualified arguments.
Ahmed J. Jabur, Asmaa Abdul Azeez Dakhil, Israa Saad Mohammed et al.· Iraqi Journal for Computers...· 0 citations
RA-QGQA is presented, which recasts triple verification as a question-driven, corpus-grounded task, and demonstrates RA-QGQA as an interactive web system in which users import a KG and its source corpus, verify all triples in a single pass, and inspect the passages that justify its verdict.
Si-Yang Liu, Hong Duc Nguyen, Yun-Miao Li et al.· Proceedings of the 2026 ACM...· 0 citations
MGDR-SDR is proposed, a training-free approach that applies constituency parsing to derive three complementary representations of the utterance that drive a multi-granular retrieval procedure that aggregates evidence across dense and sparse channels, yielding broader and more precise demonstration coverage.
Tong Li, Zhi-Peng Du, Xinyu Hu et al.· Machine Learning and Knowled...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.