Skip navigation
Please use this identifier to cite or link to this item: http://arks.princeton.edu/ark:/88435/dsp011c18dj10x
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorFellbaum, Christiane-
dc.contributor.authorLin, Kevin-
dc.date.accessioned2015-06-26T16:25:42Z-
dc.date.available2015-06-26T16:25:42Z-
dc.date.created2015-04-30-
dc.date.issued2015-06-26-
dc.identifier.urihttp://arks.princeton.edu/ark:/88435/dsp011c18dj10x-
dc.description.abstractThe task of determining the context of different words and specific senses is a crucial aspect of natural language processing, for a machine that cannot ascertain the correct meaning of the words of an input cannot glean any further form of understanding. In this work, we propose ComText - an algorithm for statistical, network-based word-sense disambiguation that utilizes a multi-layer network to generate similar words and topics based on relative proximity. We build upon the Stanford natural language parser and previous work on typed dependencies to determine the syntax from the phrase structures of our training corpus, and use these dependencies to create network maps that are then used to analyze the textual input.en_US
dc.format.extent36 pagesen_US
dc.language.isoen_USen_US
dc.titleComText: Unsupervised Word-Sense Disambiguation Through Statistical Network Analysis and Typed Dependencieen_US
dc.typePrinceton University Senior Theses-
pu.date.classyear2015en_US
pu.departmentComputer Scienceen_US
pu.pdf.coverpageSeniorThesisCoverPage-
Appears in Collections:Computer Science, 1988-2020

Files in This Item:
File SizeFormat 
PUTheses2015-Lin_Kevin.pdf833.42 kBAdobe PDF    Request a copy


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