A consonant cluster is said to be resolvable if, and only if, all sub-sequences of consonants it contains are also legal clusters in the language concerned. For example, the English coda cluster ksts as in texts is resolvable, because kst, sts, ks, st and ts are all legal coda clusters in English and all three consonants in the cluster can stand as single-term codas. The coda cluster ŋst (as in amongst), on the other hand, is not resolvable, because ŋs is not a legal coda cluster in English.