Back to search

University of Washington

Convexity is a Fundamental Feature of Efficient Semantic Compression in Probability Spaces.

Abstract

dc:description.abstract

This thesis investigates the relationship between convexity and efficient communication using a probabilistic communication model applied to color space. It builds on previous work investigating the plausibility and potential source(s) of Gardenf ̈or's proposed semantic universal: that all subsets of color space affiliated with a particular color term are convex sets. The analysis undertaken in this project makes two major contributions to the existing literature. • First, this project establish a new metric which defines a quantitative measure of convexity that can be applied to probabilistic communication models. • Second, it demonstrates that convexity is an essential feature of efficient color-naming systems, where efficiency is determined with respect to a trade-off between accuracy and complexity. Furthermore, this project demonstrates that convexity is a more significant predictor of communication efficiency than either accuracy or complexity.

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Skinner, Lindsay Paige
Advisor dc:contributor.advisor
  • Steinert-Threlkeld, Shane N

Subjects

dc:subject × 6

Rights

dc:rights
Statement dc:rights
  • CC BY
Language dc:language.iso
en_US

Identifiers

dc:identifier.*
Handle dc:identifier.uri
https://hdl.handle.net/1773/53008

Chain of custody

source
Harvested from
University of Washington
Base URL
digital.lib.washington.edu/server/oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Skinner, Lindsay Paige. Convexity is a Fundamental Feature of Efficient Semantic Compression in Probability Spaces.. 2025. https://hdl.handle.net/1773/53008