pith. sign in

arxiv: 1807.01763 · v3 · pith:D3CJMJJ6new · submitted 2018-07-04 · 💻 cs.CL · cs.AI

Seq2RDF: An end-to-end application for deriving Triples from Natural Language Text

classification 💻 cs.CL cs.AI
keywords graphknowledgelanguageapproachend-to-endgivennaturaltext
0
0 comments X
read the original abstract

We present an end-to-end approach that takes unstructured textual input and generates structured output compliant with a given vocabulary. Inspired by recent successes in neural machine translation, we treat the triples within a given knowledge graph as an independent graph language and propose an encoder-decoder framework with an attention mechanism that leverages knowledge graph embeddings. Our model learns the mapping from natural language text to triple representation in the form of subject-predicate-object using the selected knowledge graph vocabulary. Experiments on three different data sets show that we achieve competitive F1-Measures over the baselines using our simple yet effective approach. A demo video is included.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.