Show simple item record

dc.contributor.advisorSanjeev Mohindra.en_US
dc.contributor.authorSun, Christina, M. Eng. Massachusetts Institute of Technologyen_US
dc.contributor.otherMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.en_US
dc.date.accessioned2018-12-18T19:46:41Z
dc.date.available2018-12-18T19:46:41Z
dc.date.copyright2018en_US
dc.date.issued2018en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/119708
dc.descriptionThesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.en_US
dc.descriptionThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.en_US
dc.descriptionCataloged from student-submitted PDF version of thesis.en_US
dc.descriptionIncludes bibliographical references (pages 67-69).en_US
dc.description.abstractAn 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.en_US
dc.description.statementofresponsibilityby Christina Sun.en_US
dc.format.extent69 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT 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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectElectrical Engineering and Computer Science.en_US
dc.titleA natural language interface for querying graph databasesen_US
dc.typeThesisen_US
dc.description.degreeM. Eng.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.identifier.oclc1078222310en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record