Around the GLOBE: Numerical Aggregation Question-Answering on Heterogeneous Genealogical Knowledge Graphs with Deep Neural Networks
Not on the map. Why?
Abstract (arXiv)
One of the key AI tools for textual corpora exploration is natural language question-answering (QA). Unlike keyword-based search engines, QA algorithms receive and process natural language questions and produce precise answers to these questions, rather than long lists of documents that need to be manually scanned by the users. State-of-the-art QA algorithms based on DNNs were successfully employed in various domains. However, QA in the genealogical domain is still underexplored, while researchers in this field (and other fields in humanities and social sciences) can highly benefit from the ability to ask questions in natural language, receive concrete answers and gain insights hidden within large corpora. While some research has been recently conducted for factual QA in the genealogical domain, to the best of our knowledge, there is no previous research on the more challenging task of numerical aggregation QA (i.e., answering questions combining aggregation functions, e.g., count, average, max). Numerical aggregation QA is critical for distant reading and analysis for researchers (and the general public) interested in investigating cultural heritage domains. Therefore, in this study, we present a new end-to-end methodology for numerical aggregation QA for genealogical trees that includes: 1) an automatic method for training dataset generation; 2) a transformer-based table selection method, and 3) an optimized transformer-based numerical aggregation QA model. The findings indicate that the proposed architecture, GLOBE, outperforms the state-of-the-art models and pipelines by achieving 87% accuracy for this task compared to only 21% by current state-of-the-art models. This study may have practical implications for genealogical information centers and museums, making genealogical data research easy and scalable for experts as well as the general public.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 42 of its 102 references that are in the map. First posted on arXiv 30 Jul 2023.
Builds on
42 of 102 references.
References · 42
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,170
- 2020Longformer: The Long-Document Transformercited by 3,413
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2020Reformer: The Efficient Transformercited by 1,668
- 2016MS MARCO: A Human Generated MAchine Reading COmprehension Datasetcited by 1,605
- 2019PEGASUS: Pre-training with Extracted Gap-sentences for Abstractive Summarizationcited by 1,102
- 2019DROP: A Reading Comprehension Benchmark Requiring Discrete Reasoning Over Paragraphscited by 903
- 2019Latent Retrieval for Weakly Supervised Open Domain Question Answeringcited by 695
- 2017Seq2SQL: Generating Structured Queries from Natural Language using Reinforcement Learningcited by 687
- 2015Compositional Semantic Parsing on Semi-Structured Tablescited by 515
- 2020TAPAS: Weakly Supervised Table Parsing via Pre-trainingcited by 434
30 more
- 2019RAT-SQL: Relation-Aware Schema Encoding and Linking for Text-to-SQL Parserscited by 424
- 2021A Survey of Data Augmentation Approaches for NLPcited by 409
- 2020TaBERT: Pretraining for Joint Understanding of Textual and Tabular Datacited by 398
- 2021FeTaQA: Free-form Table Question Answeringcited by 175
- 2020Injecting Numerical Reasoning Skills into Language Modelscited by 133
- 2019A Discrete Hard EM Approach for Weakly Supervised Question Answeringcited by 78
- 2021Open Domain Question Answering over Tables via Dense Retrievalcited by 74
- 2020Understanding tables with intermediate pre-trainingcited by 68
- 2019NumNet: Machine Reading Comprehension with Numerical Reasoningcited by 59
- 2018Memory Augmented Policy Optimization for Program Synthesis and Semantic Parsingcited by 57
- 2021MATE: Multi-view Attention for Table Transformer Efficiencycited by 54
- 2019Giving BERT a Calculator: Finding Operations and Arguments with Reading Comprehensioncited by 51
- 2016Dynamic Coattention Networks For Question Answeringcited by 49
- 2016Machine Comprehension Using Match-LSTM and Answer Pointercited by 47
- 2017From Language to Programs: Bridging Reinforcement Learning and Maximum Marginal Likelihoodcited by 41
- 2019Learning to Generalize from Sparse and Underspecified Rewardscited by 39
- 2019Learning Semantic Parsers from Denotations with Latent Structured Alignments and Abstract Programscited by 26
- 2019Answering Conversational Questions on Structured Data without Logical Formscited by 24
- 2020Text-based Question Answering from Information Retrieval and Deep Neural Network Perspectives: A Surveycited by 21
- 2016Learning a Natural Language Interface with Neural Programmercited by 14
- 2017Macro Grammars and Holistic Triggering for Efficient Semantic Parsingcited by 10
- 2021DoT: An efficient Double Transformer for NLP tasks with tablescited by 8
- 2018Knowledge-Aware Conversational Semantic Parsing Over Web Tablescited by 6
- 2022Is GPT-3 all you need for Visual Question Answering in Cultural Heritage?cited by 6
- 2021Toward the Optimized Crowdsourcing Strategy for OCR Post-Correctioncited by 5
- 2021Injecting Numerical Reasoning Skills into Knowledge Base Question Answering Modelscited by 4
- 2016Multi-Perspective Context Matching for Machine Comprehensioncited by 2
- 2021Does Dialog Length matter for Next Response Selection task? An Empirical Studycited by 2
- 2017Neural Multi-Step Reasoning for Question Answering on Semi-Structured Tablescited by 1
- 2019Table2answer: Read the database and answer without SQLcited by 1
Built on by
Not cited yet.