MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
  • DSpace@MIT Home
  • MIT Libraries
  • MIT Theses
  • Graduate Theses
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A natural language interface for querying graph databases

Author(s)
Sun, Christina, M. Eng. Massachusetts Institute of Technology
Thumbnail
DownloadFull printable version (965.3Kb)
Other Contributors
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.
Advisor
Sanjeev Mohindra.
Terms of use
MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
An increasing amount of knowledge in the world is stored in graph databases. However, most people have limited or no understanding of database schemes and query languages. Providing a tool that translates natural language queries into structured queries allows people without this technical knowledge or specific domain expertise to retrieve information that was previously inaccessible. Many existing natural language interfaces to databases (NLIDB) propose solutions that may not generalize well to multiple domains and may require excessive feature engineering, manual customization, or large amounts of annotated training data. We present a method for constructing subgraph queries which can represent a graph of activities, events, persons, behaviors, and relations, for search against a graph database containing information from a variety of data sources. Our model interprets complex natural language queries by using a pipeline of named entity recognition and binary relation extraction models to identify key entities and relations corresponding to graph components such as nodes, attributes, and edges. This information is combined in order to create structured graph queries, which may then be applied to graph databases. By breaking down the translation task into a pipeline of several submodules, our model achieves a prediction accuracy of 46.9 % with a small training set of only 218 sentences.
Description
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.
 
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
 
Cataloged from student-submitted PDF version of thesis.
 
Includes bibliographical references (pages 67-69).
 
Date issued
2018
URI
http://hdl.handle.net/1721.1/119708
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.

Collections
  • Graduate Theses

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.