Summary: We study the problem of “definability” of a binary word of length \(n\) through subwords when we take into account the multiplicity of occurrences of each subword of length \(k\). The case \(k = 2\) is studied in detail. The maximum length of subwords is found that is necessary for the unique recovery of any word of the length \(n\).