<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-09-20T04:06:57Z</responseDate><request verb="GetRecord" identifier="oai:dspace.mit.edu:1721.1/119564" metadataPrefix="dim">https://dspace.mit.edu/server/oai/request</request><GetRecord><record><header><identifier>oai:dspace.mit.edu:1721.1/119564</identifier><datestamp>2026-06-06T00:56:08Z</datestamp><setSpec>com_1721.1_7582</setSpec><setSpec>com_1721.1_7581</setSpec><setSpec>col_1721.1_131023</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:doc="http://www.lyncode.com/xoai" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor" lang="en_US">Patrick H. Winston.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" lang="en_US">Taylor, Ada (Ada V.)</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="other" lang="en_US">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="department">Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2018-12-11T20:40:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2018-12-11T20:40:19Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="copyright" lang="en_US">2018</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued" lang="en_US">2018</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/1721.1/119564</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="oclc" lang="en_US">1076274845</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2018.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">This electronic version was submitted by the student author.  The certified thesis is available in the Institute Archives and Special Collections.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Cataloged from student-submitted PDF version of thesis.</dim:field>
   <dim:field mdschema="dc" element="description" lang="en_US">Includes bibliographical references (pages 109-110).</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en_US">Humor is a creative, ubiquitous, and powerful communication strategy, yet it is currently challenging for computers to correctly identify instances of humor, let alone understand it. In this thesis I develop a computational model of humor based on error identification and resolution, as well as methods for understanding the mental trajectory required for successful humor appreciation. An infrastructure for constructing humor detectors based on this theory is implemented in the context of a general error handling and investigation system for the Genesis story-understanding system. The computational model consists of a series of Experts that quantify important story elements such as allyship, harm to characters, character traits, karma, morbidity, contradiction, and unexpected events. Due to the homogeneous structure of their interactions, Experts using different methodologies such as simulation, Bayesian reasoning, neural nets, or symbolic reasoning can all interact, share findings of interest, and suggest reasons for each other's issues through this system. This system of Experts can identify the resolvable narrative laws that drive humor, therefore they are also able to discover unintentional problems within narratives. I have additionally demonstrated successful quantification of indicators of effective human engagement with narrative such as suspense, attention span length, attention density, and moments of insight. Variations in Expert parameters account for different senses of humor in individuals. This new scope of understanding allows Genesis to help authors search their narratives to determine if higher level narrative mechanics are well executed or not, a crucial role usually reserved for a human editor. By successfully demonstrating a framework for computational recognition and comprehension of humor, I have begun to show that computers are capable of sharing an ability previously considered an exclusively human quality.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="statementofresponsibility" lang="en_US">by Ada Taylor.</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="degree" lang="en_US">M.Eng.</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="extent" lang="en_US">110 pages</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en_US">eng</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en_US">Massachusetts Institute of Technology</dim:field>
   <dim:field mdschema="dc" element="rights" lang="en_US">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.</dim:field>
   <dim:field mdschema="dc" element="rights" qualifier="uri" lang="en_US">http://dspace.mit.edu/handle/1721.1/7582</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en_US">Electrical Engineering and Computer Science.</dim:field>
   <dim:field mdschema="dc" element="title" lang="en_US">Computational recognition and comprehension of humor in the context of a general error investigation system</dim:field>
   <dim:field mdschema="dc" element="type" lang="en_US">Thesis</dim:field>
   <dim:field mdschema="dc" element="format" qualifier="mimetype">application/pdf</dim:field>
   <dim:field mdschema="dspace" element="authorsordered">false</dim:field>
   <dim:field mdschema="dspace" element="entity" qualifier="type">Publication</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="others" element="access-status">unknown</dim:field>
   <dim:field mdschema="cerif" element="openaire" authority="" confidence="-1">&lt;Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="e4a86b70-3654-473f-be5c-12ca4947bd36">
	&lt;Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843&lt;/Type>
	&lt;Language>eng&lt;/Language>
   	&lt;Title>Computational recognition and comprehension of humor in the context of a general error investigation system&lt;/Title>
   	&lt;PublishedIn>
    	&lt;Publication>
      	&lt;/Publication>
   	&lt;/PublishedIn>
   	&lt;PublicationDate>2018&lt;/PublicationDate>
   	&lt;Authors>
      	&lt;Author>
        	&lt;DisplayName>Taylor, Ada (Ada V.)&lt;/DisplayName>
         	&lt;Affiliation>
         		&lt;OrgUnit>
         		&lt;/OrgUnit>
         	&lt;/Affiliation>
      	&lt;/Author>
	&lt;/Authors>
   	&lt;Editors>
	&lt;/Editors>
    &lt;Publishers>
        &lt;Publisher>
            &lt;DisplayName>Massachusetts Institute of Technology&lt;/DisplayName>
            &lt;OrgUnit />
        &lt;/Publisher>
    &lt;/Publishers>
    &lt;License>http://dspace.mit.edu/handle/1721.1/7582&lt;/License>
    &lt;Keyword>Electrical Engineering and Computer Science.&lt;/Keyword>
   	&lt;Abstract>Humor is a creative, ubiquitous, and powerful communication strategy, yet it is currently challenging for computers to correctly identify instances of humor, let alone understand it. In this thesis I develop a computational model of humor based on error identification and resolution, as well as methods for understanding the mental trajectory required for successful humor appreciation. An infrastructure for constructing humor detectors based on this theory is implemented in the context of a general error handling and investigation system for the Genesis story-understanding system. The computational model consists of a series of Experts that quantify important story elements such as allyship, harm to characters, character traits, karma, morbidity, contradiction, and unexpected events. Due to the homogeneous structure of their interactions, Experts using different methodologies such as simulation, Bayesian reasoning, neural nets, or symbolic reasoning can all interact, share findings of interest, and suggest reasons for each other&amp;apos;s issues through this system. This system of Experts can identify the resolvable narrative laws that drive humor, therefore they are also able to discover unintentional problems within narratives. I have additionally demonstrated successful quantification of indicators of effective human engagement with narrative such as suspense, attention span length, attention density, and moments of insight. Variations in Expert parameters account for different senses of humor in individuals. This new scope of understanding allows Genesis to help authors search their narratives to determine if higher level narrative mechanics are well executed or not, a crucial role usually reserved for a human editor. By successfully demonstrating a framework for computational recognition and comprehension of humor, I have begun to show that computers are capable of sharing an ability previously considered an exclusively human quality.&lt;/Abstract>
	&lt;Access xmlns="http://purl.org/coar/access_right" 
    >
    &lt;/Access>
&lt;/Publication>
</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>