Table 1.

Specification of proposed sense extension algorithms

Model	$p(s*)$
Exemplar	$\propto f(s*,S(t))=E_{s\in S(t)}[sim(s*,s)]$
Prototype	$\propto f(s*,S(t))=sim(s*,prototype(S(t)))$
Progenitor	$\propto f(s*,S(t))=sim(s*,s_0)$
Local	$\propto f(s*,S(t))=sim(s*,s_t)$
Nearest-neighbor chaining	$\propto f(s*,S(t))={\max }_{s\in S(t)}sim(s*,s)$