Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp01rj430716r
Full metadata record
DC FieldValueLanguage
dc.contributorKatz, Joshua T.-
dc.contributor.advisorFellbaum, Christiane D.-
dc.contributor.authorDemszky, Dora-
dc.date.accessioned2017-07-17T15:45:08Z-
dc.date.available2017-07-17T15:45:08Z-
dc.date.created2017-05-08-
dc.date.issued2017-5-8-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp01rj430716r-
dc.description.abstractModeling logical inference has become a key building block in the improvement of manyNLP tasks, including summarization, question answering and information extraction.However, since the rules that underlie inference are rarely made explicit in naturallanguage, there is a need for specialized datasets from which these rules can be learned.We introduce Stanford Textual Inference Chains (StaTIC), a dataset of sentence pairs inan entailment relation that are also “minimal pairs”, differing from each other by a smallsyntactic or lexical change. In this thesis, we describe and evaluate our data collectionmethods and analyze the lexical and syntactic properties of the results, focusing on theways in which they make the dataset suitable for informing systems of natural languageunderstanding.en_US
dc.language.isoen_USen_US
dc.titleStaTIC: A Dataset of Question-Driven Inference Chainsen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2017en_US
pu.departmentIndependent Concentrationen_US
pu.pdf.coverpageSeniorThesisCoverPage-
pu.contributorid410076165-
pu.contributor.authorid960880209-
pu.contributor.advisorid010000066-
pu.certificateApplications of Computing Programen_US
Appears in Collections:Independent Concentration, 1972-2023

Files in This Item:
File SizeFormat 
ddemszky_thesis.pdf1.18 MBAdobe PDF    Request a copy


Items in Dataspace are protected by copyright, with all rights reserved, unless otherwise indicated.