Aug 2026· Scientific Data· 0 citations· 35 references
Computer Science
TL;DR
This study introduces OpenSubAffil, a large-scale dataset mapping raw affiliation strings from OpenAlex to disambiguated sub-institutional entities and their hierarchical structures, and develops a pipeline integrating named entity recognition (NER) with embedding-based clustering.
Abstract
Accurate attribution of scholarly work to specific sub-institutional units, such as schools or departments of a university, is crucial for granular research assessment and policymaking. While robust identifiers exist for top-level institutions, standardized data for sub-level units remains scarce due to the linguistic and structural variability of affiliation strings. In this study, we introduce OpenSubAffil, a large-scale dataset mapping raw affiliation strings from OpenAlex to disambiguated sub-institutional entities and their hierarchical structures. We developed a pipeline integrating named entity recognition (NER) with embedding-based clustering. Furthermore, we proposed a multi-signal scoring function that synthesizes lexical and co-occurrence evidence to reconstruct the sub-institutional hierarchy. OpenSubAffil comprises mappings for 40 million affiliation strings to 638,843 disambiguated sub-units across 18,635 top-level institutions, together with their hierarchical relationships. Validation against Wikidata benchmarks and manual investigation show that our method achieves promising performance. Overall, this dataset bridges the granularity gap between individual researchers and top-level institutions, enabling high-resolution analyses of scholarly output and communication at the sub-institutional level. The OpenSubAffil dataset is publicly available at https://doi.org/10.5281/zenodo.19602782.
Organizing unstructured feedback text into hierarchical taxonomy is a fundamental challenge in NLP, particularly in domains where feedback arrives at massive scale in varied forms such as reviews, transcripts, and surveys. Existing approaches either produce shallow hierarchies, neglect long-tail topics, or lack rigorous evaluation frameworks. We present TaxCE, a fully automated framework that constructs multi-level hierarchical taxonomies from raw text through progressive condensation of corpus content into actionable segments, deduplicated semantic units, and granular topics with definitions, which are then organized bottom-up into a hierarchy with corpus-groundedness. We also introduce three corpus-grounded evaluation metrics, Exclusivity, Exhaustivity, and Granularity (EEG), and integrate them into a metrics-in-the-loop iterative refinement mechanism that diagnoses deficiencies and applies targeted corrections until convergence. Extensive experiments demonstrate that TaxCE consistently outperforms existing baselines spanning classical topic models, neural methods, and LLM-based approaches, with average improvements of 11.8, 20.5, and 15.7 percentage points in exclusivity, exhaustivity, and granularity respectively over the strongest baseline. Human evaluation further confirms superior taxonomy quality, actionability, and navigability.
Sandeep Sricharan Mukku, Albert Nanda, Rohit Pyati· 0 citations
Personal names carry cultural and linguistic identity, yet most African countries lack large-scale, structured name datasets suitable for natural language processing (NLP) research and computational social science. We present CongoNames, the first large-scale corpus of personal names from the Democratic Republic of the Congo (DRC), derived from publicly released national secondary-school examination palmarès (result lists) 8,053,983 published annually by the DRC Ministry of Education. The corpus comprises name records spanning 16 examination years (2008–2023) across 12 provinces and 304 sub-provincial regions, each enriched with a reported sex marker (M/F) and regional provenance metadata. We describe a fully deterministic, layered processing pipeline (bronze–silver–gold architecture) that converts raw protable document format (PDF) documents into structured comma-separated values (CSV) datasets without manual annotation or machine-learning-based inference. The dataset is validated against school-level census counts extracted from the same source PDFs, yielding extraction error rates below 2% for all years except 2023 (7.81%, flagged due to a layout change). Descriptive analyses document name length and token-count distributions, character-level n-gram profiles, provincial diversity indices, and inter-provincial name-inventory overlap, collectively establishing the dual linguistic origin—locally rooted Bantu components and Christian/French-origin components—that characterize modern Congolese naming practice. The dataset, processing code, and documentation are released openly to support research in African natural language processing (NLP), onomastics, and computational social science.
The automatic structural analysis of legal texts is a cornerstone of legal technology, yet the extraction of their logical components remains a significant challenge. In this paper, we introduce the task of identifying and segmenting legal conditions (Tatbestand) and legal consequences (Rechtsfolge) within German statutory texts. To support this task, we present ANNOTARES (Annotations of Tatbestand-Rechtsfolge Sequences), a novel dataset comprising German law texts with span-level annotations. Spanning three distinct legal codes, the dataset is designed to evaluate both domain-specific performance and cross-statute generalizability. We benchmark diverse architectural approaches: a rule-based baseline, CRFs, BiLSTMs, BiLSTM-CRF, and modern Transformer-based models, including BERT variants and LLM-based methods. Our results demonstrate that BERT and LLM-based models achieve superior performance in capturing the complex syntactic structures of legal language. We release our dataset to facilitate further research in automated legal reasoning.
Automated Knowledge Base Construction (AKBC) is a core NLP task, and recent work proposes generating knowledge bases directly from large language models (LLMs), treating the model itself as the knowledge source. However, LLMs natively possess no representation of entities, leading to duplicate entries as well as conflations. We propose GPTKB 2.0, a methodology for constructing disambiguated KBs directly from LLMs. GPTKB 2.0 incorporates on-the-fly disambiguation of entities, relations and classes, and is meticulously designed to satisfy both scalability and disambiguation accuracy. We analyze the central design decisions and characterize the trade-offs between accuracy, scale, and cost. We execute GPTKB 2.0 at scale, obtaining a materialized KB containing over 1M disambiguated entities and 38.4M triples. This represents the first million-scale LLM-native KB with explicit internal canonicalization of entities, relations, and classes, a significant departure from prior Wikimedia-centric works. GPTKB 2.0 is available at https://gptkb.org/.
Yujia Hu, Tuan-Phong Nguyen, S. Razniewski· 0 citations
Automatic extraction of genealogical information from historical archival-genealogical documents in Uzbek is an understudied problem for low-resource languages. Multi-layer NLP benchmarks are not sufficient to automatically identify individuals, family relationships, dates, place names, and archival identifiers in such texts. Also, the same people are mentioned in various forms: full name, pronoun (18.8%), initial, surname-name order, indirect expression (9.4%), and title. Existing NER and relation extraction corpora are mainly focused on high-resource languages or general domain texts and do not sufficiently cover the FAMILY_ROLE signals, historical spelling variants, and fond–opis–delos identifiers specific to Uzbek archival-genealogical texts. Proposed resource: We present the ArchiveGene Corpus, a controlled, fully synthetic, and reproducible five-layer resource consisting of 1000 Uzbek archival-genealogical-style documents, divided into 700 training, 150 validation, and 150 test documents. The corpus contains 8366 named entities, 10,625 person mentions, 2000 coreference chains, and 1000 genealogical relation triples. The dataset was generated using a deterministic template-based pipeline and a lexicon of Uzbek names, and is fully reproducible. Inter-annotator agreement values were 0.847 for NER, 0.793 for coreference, and 0.821 for RE, according to Cohen’s κ. Comparative results are presented with four baseline models (rule-based, BiLSTM-CRF, mBERT, and XLM-RoBERTa). The dataset is openly hosted on the Zenodo platform under the CC BY 4.0 license; concept DOI: 10.5281/zenodo.20670360, v1.1.1 version DOI: 10.5281/zenodo. 21429998. Scientific significance: To the best of our knowledge, ArchiveGene is among the first openly released, controlled synthetic resources for Uzbek that integrates named-entity recognition, person-mention detection, coreference resolution, genealogical relation extraction, and final tuple generation within a single annotation framework. The baseline analysis provides three main conclusions: (1) on the clean synthetic test set, the transformer models already reach 100.00 Micro-F1 for NER and 100.00 Macro-F1 for coreference-aware relation extraction, so coreference aggregation adds little on synthetic data (+2.25 for mBERT and +0.04 for XLM-RoBERTa) but its contribution is expected to grow on real archival text; (2) the rule-based and heuristic baselines lag far behind (Macro-F1 50.28 and 70.73) and fail entirely on spouse_of, showing the limits of lexical rules; and (3) a zero-shot evaluation on a real-document pilot reduces NER Micro-F1 from 100.00 to 22.17, indicating that the synthetic corpus is trivially learnable and that real-archival validation is essential.
A. Dauletov, N. Matyakubova, Sevara Allabergenova et al.· International Conference on...· 0 citations
MGAL is the first multilingual, granularity- and position-aware long-context benchmark, constructed from United Nations reports spanning 8K to 128K tokens across the six official UN languages, and finds that LLMs perform well at word-level tasks but struggle with coarser-grained ones.
Chunhan Li, Chenglin Xu, Zongyang Zhang et al.· 0 citations
