Learning precise partial semantic mappings via linear algebra

Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 41-42). === In natural language interfaces, having high p...

Full description

Bibliographic Details
Main Author: Khani, Fereshte
Other Authors: Martin Rinard.
Format: Others
Language:English
Published: Massachusetts Institute of Technology 2016
Subjects:
Online Access:http://hdl.handle.net/1721.1/106099
Description
Summary:Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016. === Cataloged from PDF version of thesis. === Includes bibliographical references (pages 41-42). === In natural language interfaces, having high precision, i.e., abstaining when the system is unsure, is critical for good user experience. However, most NLP systems are trained to maximize accuracy with precision as an afterthought. In this thesis, we put precision first and ask: Can we learn to map parts of the sentence to logical predicates with absolute certainty? To tackle this question, we model semantic mappings from words to predicates as matrices, which allows us to reason efficiently over the entire space of semantic mappings consistent with the training data. We prove that our method obtains 100% precision. Empirically, we demonstrate the effectiveness of our approach on the GeoQuery dataset. === by Fereshte Khani. === S.M. in Computer Science and Engineering