BIRD: Bronze Inscription Restoration and Dating
Not on the map. Why?
Abstract (arXiv)
Bronze inscriptions from early China are fragmentary and difficult to date. We introduce BIRD(Bronze Inscription Restoration and Dating), a fully encoded dataset grounded in standard scholarly transcriptions and chronological labels. We further propose an allograph-aware masked language modeling framework that integrates domain- and task-adaptive pretraining with a Glyph Net (GN), which links graphemes and allographs. Experiments show that GN improves restoration, while glyph-biased sampling yields gains in dating.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 14 of its 54 references that are in the map. First posted on arXiv 3 Nov 2025.
Builds on
14 of 54 references.
References · 14
- 2017Attention Is All You Needcited by 59,932
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
- 2019Unsupervised Cross-lingual Representation Learning at Scalecited by 3,907
- 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
- 2020Don't Stop Pretraining: Adapt Language Models to Domains and Taskscited by 1,548
- 2015Effective Approaches to Attention-based Neural Machine Translationcited by 1,024
- 2023Chinese Text Recognition with A Pre-Trained CLIP-Like Model Through Image-IDS Aligningcited by 24
- 2020Dynamic Semantic Matching and Aggregation Network for Few-shot Intent Detectioncited by 17
- 2023Enhancing Cross-lingual Transfer via Phonemic Transcription Integrationcited by 11
- 2021Filling the Gaps in Ancient Akkadian Texts: A Masked Language Modelling Approachcited by 8
- 2024Prompting with Phonemes: Enhancing LLMs' Multilinguality for Non-Latin Script Languagescited by 6
2 more
- 2023Weighted Sampling for Masked Language Modelingcited by 2
- 2025Logits-Constrained Framework with RoBERTa for Ancient Chinese NERcited by 1
Built on by
Citing papers per year: 2026: 2.
2 papers.