Papers › Learning of Colors from Color Names: Distribution and Point Estimation

Learning of Colors from Color Names: Distribution and Point Estimation

27 Sep 2017arXiv:1709.09360archive 2025-07-28

Lyndon White, Roberto Togneri, Wei Liu, Mohammed Bennamoun

Color names are often made up of multiple words. As a task in natural language understanding we investigate in depth the capacity of neural networks based on sums of word embeddings (SOWE), recurrence (LSTM and GRU based RNNs) and convolution (CNN), to estimate colors from sequences of terms. We consider both point and distribution estimates of color. We argue that the latter has a particular value as there is no clear agreement between people as to what a particular color describes -- different people have a different idea of what it means to be ``very dark orange'', for example. Surprisingly, despite it's simplicity, the sum of word embeddings generally performs the best on almost all evaluations.

PaperPDFCode

Code

oxinabox/ColoringNames.jl officialmentioned in papermentioned on GitHub report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Natural Language UnderstandingWord Embeddings

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

ConvolutionGRU

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections