Capturing Knowledge in Semantically-typed Relational Patterns to Enhance Relation Linking
Abstract
Transforming natural language questions into formal queries is an integral task in Question Answering (QA) systems. QA systems built on knowledge graphs like DBpedia, require a step after natural language processing for linking words, specifically including named entities and relations, to their corresponding entities in a knowledge graph. To achieve this task, several approaches rely on background knowledge bases containing semantically-typed relations, e.g., PATTY, for an extra disambiguation step. Two major factors may affect the performance of relation linking approaches whenever background knowledge bases are accessed: a) limited availability of such semantic knowledge sources, and b) lack of a systematic approach on how to maximize the benefits of the collected knowledge. We tackle this problem and devise SIBKB, a semantic-based index able to capture knowledge encoded on background knowledge bases like PATTY. SIBKB represents a background knowledge base as a bi-partite and a dynamic index over the relation patterns included in the knowledge base. Moreover, we develop a relation linking component able to exploit SIBKB features. The benefits of SIBKB are empirically studied on existing QA benchmarks and observed results suggest that SIBKB is able to enhance the accuracy of relation linking by up to three times.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Existing relation linking methods mainly rely on textual similarities between natural language and knowledge graph to build relation links.
“Existing methods mainly rely on the textual similarities between NL and KG to build relation links.”
From Implicit Relation Linking for Question Answering over Knowledge Graph (2022) · cites this paper as Singh et al., 2017
SIBKB uses PATTY as the underlying knowledge source and establishes a bipartite graph index from common phrases in natural language to KG relations for relation linking.
“SIBKB (Singh et al., 2017) uses PATTY as the underlying knowledge source, and establishes a bipartite graph index from common phrases in NL to KG relations for RL.”
From Implicit Relation Linking for Question Answering over Knowledge Graph (2022) · cites this paper as Singh et al., 2017
Cited by
Sorted by citations
Implicit Relation Linking for Question Answering over Knowledge Graph
Zhao, Y., Huang, J., Hu, W., Chen, Q., Qiu, X., Huo, C., & Ren, W. (2022) · Findings of the Association for Computational Linguistics: ACL 2022 · doi:10.18653/v1/2022.findings-acl.312 · Cited by 5 · see citing works
- Authors
- Singh, K., Mulang', I. O., Lytra, I., Jaradeh, M. Y., Sakor, A., Vidal, M.-E., Lange, C., & Auer, S.
- Affiliations
- University of Bonn (DE)
- University of Bonn & Fraunhofer, IAIS, Germany
- Fraunhofer IAIS, Germany
- Leibniz University Hannover (DE)
- Venue
- Proceedings of the Knowledge Capture Conference
- Publisher
- ACM
- Published
- 2017-12-04
- Pages
- 1-8
- OpenAlex
- W2778792674
- Cited by
- 24
- References
- 0
- Citations by year
- 2026: 1 · 2025: 1 · 2023: 4 · 2022: 2 · 2021: 4 · 2020: 2 · 2019: 5 · 2018: 5
- FWCI
- 1.50
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Knowledge Capture (publishedVersion)
- Publikationsdatenbank der Fraunhofer-Gesellschaft (Fraunhofer-Gesellschaft) (submittedVersion)
- Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
- Funders
- H2020 Marie Skłodowska-Curie Actions
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
- Physical Sciences › Computer Science › Artificial Intelligence › Natural Language Processing Techniques
- Physical Sciences › Computer Science › Artificial Intelligence › Semantic Web and Ontologies
- Keywords
- semantic knowledge base, patties, knowledge graphs, question answering, dynamic index, named entity linking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review