Skip to content

This is a fork, you can find the original repository for my COLING 2018 paper under the UKP Lab account. Please refer there for issues and discussion.

License

Notifications You must be signed in to change notification settings

daniilsorokin/coling2018-graph-neural-networks-question-answering

 
 

Repository files navigation

Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering

Question Answering on Wikidata

This is an accompanying repository for our COLING 2018 paper (pdf). It contains the code to provide additional information on the experiments and the models described in the paper.

We are working on improving the code to make it easy to exactly replicate the experiments and apply to new question answering data. We also plan to release a separate implementation of the gated graph neural networks.

Disclaimer:

This repository contains experimental software and is published for the sole purpose of giving additional background details on the respective publication.

Please use the following citation:

@InProceedings{C18-1280,
  author = 	"Sorokin, Daniil
		and Gurevych, Iryna",
  title = 	"Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering",
  booktitle = 	"Proceedings of the 27th International Conference on Computational Linguistics",
  year = 	"2018",
  publisher = 	"Association for Computational Linguistics",
  pages = 	"3306--3317",
  location = 	"Santa Fe, New Mexico, USA",
  url = 	"http://aclweb.org/anthology/C18-1280"
}

Paper abstract:

The most approaches to Knowledge Base Question Answering are based on semantic parsing. In this paper, we address the problem of learning vector representations for complex semantic parses that consist of multiple entities and relations. Previous work largely focused on selecting the correct semantic relations for a question and disregarded the structure of the semantic parse: the connections between entities and the directions of the relations. We propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse. We show on two data sets that the graph networks outperform all baseline models that do not explicitly model the structure. The error analysis confirms that our approach can successfully process complex semantic parses.

Please, refer to the paper for more the model description and training details.

Contacts:

If you have any questions regarding the code, please, don't hesitate to contact the authors or report an issue.

Project structure:

FileDescription
configs/Configuration files for the experiments
questionanswering/constructionBase classes for semantic graphs
questionanswering/datasetsDatasets IO
questionanswering/groundingGrounding graphs in KBs
questionanswering/modelsModel definition and training scripts
questionanswering/preprocessingMapping data sets to Wikidata
resources/Necessary resources

Requirements:

Running the experiments from the paper:

[Coming soon]

Using the pre-trained model:

[Coming soon]

License:

  • Apache License Version 2.0

About

This is a fork, you can find the original repository for my COLING 2018 paper under the UKP Lab account. Please refer there for issues and discussion.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 87.5%
  • JavaScript 8.6%
  • HTML 3.1%
  • CSS 0.8%