{"id":{"repo_id":"mit","oai_identifier":"oai:dspace.mit.edu:1721.1/77443"},"canonical_url":"https://search.dev.ndltd.org/etd/mit/oai:dspace.mit.edu:1721.1/77443","repository":{"repo_id":"mit","name":"MIT","base_url":"https://dspace.mit.edu/oai/request"},"display":{"title":"A computational model of quantification in natural language","abstract":"Natural languages have various ways of expressing quantification, such as the English words \"some\" and \"all.\" Different such words exist in different languages, and the same word can communicate quite different quantities depending on the context. This thesis presents a computational framework for modeling quantificational meanings and their use in communication. The model can represent meanings that depend on absolute amounts (e.g., two) as well as relative amounts (e.g., half of the total) and context-dependent amounts. It can also represent meanings with presuppositions. Communication between a speaker and a listener is modeled as single exchanges in which both participants have noisy perception of the actual state of the world, the speaker tries to communicate some quantity to the listener by using some word chosen to be informative, and the listener tries to infer the quantity using the word and the assumption that the speaker was being informative. The usage patterns predicted by the model are qualitatively similar to how the words are actually used. The model also shows that the sets of words in real languages result in more efficient communication than randomly selected sets of words with comparable meanings.","abstract_html":"Natural languages have various ways of expressing quantification, such as the English words &quot;some&quot; and &quot;all.&quot; Different such words exist in different languages, and the same word can communicate quite different quantities depending on the context. This thesis presents a computational framework for modeling quantificational meanings and their use in communication. The model can represent meanings that depend on absolute amounts (e.g., two) as well as relative amounts (e.g., half of the total) and context-dependent amounts. It can also represent meanings with presuppositions. Communication between a speaker and a listener is modeled as single exchanges in which both participants have noisy perception of the actual state of the world, the speaker tries to communicate some quantity to the listener by using some word chosen to be informative, and the listener tries to infer the quantity using the word and the assumption that the speaker was being informative. The usage patterns predicted by the model are qualitatively similar to how the words are actually used. The model also shows that the sets of words in real languages result in more efficient communication than randomly selected sets of words with comparable meanings.","abstract_has_math":false,"creators":["Kenney, Avril (Avril Frances)"],"institution":"Massachusetts Institute of Technology","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.","school":null,"contributors":[],"advisors":["Joshua B. Tenenbaum."],"committee_chairs":[],"committee_members":[],"year":2012,"date_issued":"2012","date_published":"2012","updated_at":"2026-07-22T22:22:14Z","subjects":["Electrical Engineering and Computer Science."],"languages":["eng"],"rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"rights_urls":["http://dspace.mit.edu/handle/1721.1/7582"],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1721.1/77443","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Joshua B. Tenenbaum."]},{"key":"dc:contributor.department","label":"Department","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:contributor.other","label":"Dc Contributor Other","values":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."]},{"key":"dc:creator","label":"Author","values":["Kenney, Avril (Avril Frances)"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2013-03-01T15:05:35Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2013-03-01T15:05:35Z"]},{"key":"dc:date.issued","label":"Date","values":["2012"]},{"key":"dc:publisher","label":"Institution","values":["Massachusetts Institute of Technology"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Electrical Engineering and Computer Science."]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]},{"key":"dc:rights","label":"Dc Rights","values":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://dspace.mit.edu/handle/1721.1/7582"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1721.1/77443"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 35-36)."]},{"key":"dc:description.abstract","label":"Abstract","values":["Natural languages have various ways of expressing quantification, such as the English words \"some\" and \"all.\" Different such words exist in different languages, and the same word can communicate quite different quantities depending on the context. This thesis presents a computational framework for modeling quantificational meanings and their use in communication. The model can represent meanings that depend on absolute amounts (e.g., two) as well as relative amounts (e.g., half of the total) and context-dependent amounts. It can also represent meanings with presuppositions. Communication between a speaker and a listener is modeled as single exchanges in which both participants have noisy perception of the actual state of the world, the speaker tries to communicate some quantity to the listener by using some word chosen to be informative, and the listener tries to infer the quantity using the word and the assumption that the speaker was being informative. The usage patterns predicted by the model are qualitatively similar to how the words are actually used. The model also shows that the sets of words in real languages result in more efficient communication than randomly selected sets of words with comparable meanings."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["M.Eng."]},{"key":"dc:title","label":"Title","values":["A computational model of quantification in natural language"]}]}],"canonical_facts":{"dc:contributor.advisor":["Joshua B. Tenenbaum."],"dc:contributor.department":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:contributor.other":["Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science."],"dc:creator":["Kenney, Avril (Avril Frances)"],"dc:date.accessioned":["2013-03-01T15:05:35Z"],"dc:date.available":["2013-03-01T15:05:35Z"],"dc:date.issued":["2012"],"dc:description":["Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.","Cataloged from PDF version of thesis.","Includes bibliographical references (p. 35-36)."],"dc:description.abstract":["Natural languages have various ways of expressing quantification, such as the English words \"some\" and \"all.\" Different such words exist in different languages, and the same word can communicate quite different quantities depending on the context. This thesis presents a computational framework for modeling quantificational meanings and their use in communication. The model can represent meanings that depend on absolute amounts (e.g., two) as well as relative amounts (e.g., half of the total) and context-dependent amounts. It can also represent meanings with presuppositions. Communication between a speaker and a listener is modeled as single exchanges in which both participants have noisy perception of the actual state of the world, the speaker tries to communicate some quantity to the listener by using some word chosen to be informative, and the listener tries to infer the quantity using the word and the assumption that the speaker was being informative. The usage patterns predicted by the model are qualitatively similar to how the words are actually used. The model also shows that the sets of words in real languages result in more efficient communication than randomly selected sets of words with comparable meanings."],"dc:description.degree":["M.Eng."],"dc:identifier.uri":["http://hdl.handle.net/1721.1/77443"],"dc:language.iso":["eng"],"dc:publisher":["Massachusetts Institute of Technology"],"dc:rights":["M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission."],"dc:rights.uri":["http://dspace.mit.edu/handle/1721.1/7582"],"dc:subject":["Electrical Engineering and Computer Science."],"dc:title":["A computational model of quantification in natural language"],"dc:type":["Thesis"]},"updated_at":"2026-07-22T22:22:14Z"}