From Natural Language to RDF Graphs with Pregroups

Journal article by Antonin DelpeuchORCID, Anne Preller

Full text: Download

Publisher: Association for Computational Linguistics (ACL)

Preprint: policy unknown. Upload

Postprint: policy unknown. Upload

Published version: policy unknown. Upload

Abstract
We define an algorithm translating natural language sentences to the formal syntax of RDF, an existential conjunctive logic widely used on the Semantic Web. Our translation is based on pregroup grammars, an efficient type-logical grammatical framework with a transparent syntax-semantics interface. We introduce a restricted notion of side effects in the semantic category of finitely generated free semimodules over {0, 1} to that end. The translation gives an intensional counterpart to previous extensional models. We establish a one-to-one correspondence between extensional models and RDF models such that satisfaction is preserved. Our translation encompasses the expressivity of the target language and supports complex linguistic constructions like relative clauses and unbounded dependencies.