2021
DOI: 10.48550/arxiv.2103.06752
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Knowledge Graph Question Answering using Graph-Pattern Isomorphism

Daniel Vollmers,
Rricha Jalota,
Diego Moussallem
et al.

Abstract: Knowledge Graph Question Answering (KGQA) systems are based on machine learning algorithms, requiring thousands of question-answer pairs as training examples or natural language processing pipelines that need module fine-tuning. In this paper, we present a novel QA approach, dubbed TeBaQA. Our approach learns to answer questions based on graph isomorphisms from basic graph patterns of SPARQL queries. Learning basic graph patterns is efficient due to the small number of possible patterns. This novel paradigm re… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 25 publications
0
4
0
Order By: Relevance
“…Early work usually exploits a slotfilling method by using a set of pre-defined SPARQL templates with some slots that have to be filled. These models often design and summarize some common simple SPARQL templates for a specific dataset, such as TeBaQA [32], Template-based QA over RNN [33], and SubQG [34]. However, the templates used by these methods are not guaranteed to be adapted to other datasets [11].…”
Section: Semantic Parsing-based Methodsmentioning
confidence: 99%
“…Early work usually exploits a slotfilling method by using a set of pre-defined SPARQL templates with some slots that have to be filled. These models often design and summarize some common simple SPARQL templates for a specific dataset, such as TeBaQA [32], Template-based QA over RNN [33], and SubQG [34]. However, the templates used by these methods are not guaranteed to be adapted to other datasets [11].…”
Section: Semantic Parsing-based Methodsmentioning
confidence: 99%
“…In a different work, Unger et al [29] introduced a method to generate SPARQL query templates, utilizing the semantic structure of the question. More recently, a classification based approach was proposed by Vollmers et al [10], where semantically similar types of questions are classified to obtain a query template. Nevertheless, the query generation task remains limited due to the fixed number of schema.…”
Section: Related Workmentioning
confidence: 99%
“…Several approaches for SPARQL query generation have been presented recently [6]- [10]. The widely adopted ap-FIGURE 1.…”
Section: Introductionmentioning
confidence: 99%
“…Vollmers [135] proposes TeBaQA, an isomorphic graph-based approach. Basic graph patterns of some SPARQL queries are maintained in the repository.…”
mentioning
confidence: 99%