Inference of Shape Expression Schemas Typed RDF Graphs
Beno\^it Groz, Aur\'elien Lemay, S{\l}awek Staworko, Piotr Wieczorek

TL;DR
This paper presents a sound and complete algorithm for inferring Shape Expression Schemas (ShEx) from typed RDF graphs, demonstrating that ShEx0 schemas are learnable through grammatical inference techniques.
Contribution
It introduces a novel inference algorithm for ShEx0 schemas from typed RDF graphs, establishing the learnability of these schemas within a practical fragment.
Findings
Algorithm is sound and complete for shape graphs.
ShEx0 schemas are learnable from typed graphs.
Provides a canonical form for shape graphs.
Abstract
We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is both sound i.e., always producing a schema that validates the input RDF graph, and complete i.e., able to produce any schema, within a given class of schemas, provided that a sufficiently informative input graph is presented. We study the case where the input graph is typed i.e., every node is given with its types. We limit our attention to a practical fragment ShEx0 of Shape Expressions Schemas that has an equivalent graphical representation in the form of shape graphs. We investigate the problem of constructing a canonical representative of a given shape graph. Finally, we present a sound and complete algorithm for shape graphs thus showing that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Algorithms · Algorithms and Data Compression · Natural Language Processing Techniques
