Skip to Main content Skip to Navigation
Conference papers

From Natural Language to RDF Graphs with Pregroups

Antonin Delpeuch 1 Anne Preller 2
2 TEXTE - Exploration et exploitation de données textuelles
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
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.
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Anne Preller <>
Submitted on : Saturday, May 17, 2014 - 12:21:34 PM
Last modification on : Thursday, July 1, 2021 - 5:32:36 PM
Long-term archiving on: : Sunday, August 17, 2014 - 10:36:14 AM


Files produced by the author(s)




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⟩



Record views


Files downloads