From Natural Language to RDF Graphs with Pregroups - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2014

From Natural Language to RDF Graphs with Pregroups


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.
Fichier principal
Vignette du fichier
TTNLS2014DelpeuchPreller.pdf (246.78 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

lirmm-00992381 , version 1 (17-05-2014)



Antonin Delpeuch, Anne Preller. From Natural Language to RDF Graphs with Pregroups. TTNLS: Type Theory and Natural Language Semantics, Apr 2014, Gothenburg, Sweden. pp.55-62, ⟨10.3115/v1/W14-1407⟩. ⟨lirmm-00992381⟩
248 View
498 Download



Gmail Mastodon Facebook X LinkedIn More