Table 2.
Schematic examples of a cue matrix C (left) and a semantic matrix S (right) for the words cat, happiness, walk, and lemon.
| Schematic example of a C matrix | Schematic example of an S matrix | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| #k{ | k{ t | {t# | #h{ | h{p | CAT | HAPPINESS | WALK | LEMON | ||
| k{t | 1 | 1 | 1 | 0 | 0 | k{t | 0.000000 | −6.24e-05 | 4.71e-05 | −0.000138 |
| h{pInIs | 0 | 0 | 0 | 1 | 1 | h{pInIs | −0.000110 | 0.0000000 | 0.000194 | −2.20E-05 |
| w$k | 0 | 0 | 0 | 0 | 0 | w$k | 0.000304 | −0.0002335 | 0.000000 | −3.74E-05 |
| lEm@n | 0 | 0 | 0 | 0 | 0 | lEm@n | −7.28e-05 | −2.41e-07 | −2.68e-05 | 0.00000 |
Note that for the triphones in the C matrix, word boundaries are also counted, represented by a hash (#). The DISC phonetic alphabet is used for computer-readable transcription (Burnage, 1990).